./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.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 a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:10:58,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:10:58,671 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 22:10:58,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:10:58,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:10:58,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:10:58,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:10:58,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:10:58,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:10:58,699 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:10:58,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:10:58,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:10:58,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:10:58,700 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:10:58,700 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:10:58,700 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:10:58,700 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:10:58,700 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:10:58,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:10:58,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:10:58,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:10:58,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:10:58,701 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:10:58,701 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:10:58,701 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:10:58,701 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:10:58,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:10:58,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:10:58,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:10:58,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:10:58,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:10:58,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:10:58,702 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:10:58,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:10:58,702 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:10:58,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:10:58,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:10:58,702 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:10:58,702 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:10:58,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:10:58,702 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b [2025-03-16 22:10:58,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:10:58,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:10:58,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:10:58,933 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:10:58,934 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:10:58,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2025-03-16 22:11:00,050 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5233fe31/ff5de293f0ab41b483118d1ac580a570/FLAGbdbd05349 [2025-03-16 22:11:00,310 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:11:00,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2025-03-16 22:11:00,316 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5233fe31/ff5de293f0ab41b483118d1ac580a570/FLAGbdbd05349 [2025-03-16 22:11:00,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5233fe31/ff5de293f0ab41b483118d1ac580a570 [2025-03-16 22:11:00,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:11:00,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:11:00,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:11:00,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:11:00,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:11:00,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:11:00" (1/1) ... [2025-03-16 22:11:00,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b69775d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:00, skipping insertion in model container [2025-03-16 22:11:00,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:11:00" (1/1) ... [2025-03-16 22:11:00,650 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:11:00,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2025-03-16 22:11:00,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:11:00,830 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:11:00,837 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2025-03-16 22:11:00,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:11:00,901 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:11:00,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:00 WrapperNode [2025-03-16 22:11:00,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:11:00,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:11:00,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:11:00,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:11:00,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:00" (1/1) ... [2025-03-16 22:11:00,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:00" (1/1) ... [2025-03-16 22:11:00,983 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 642 [2025-03-16 22:11:00,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:11:00,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:11:00,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:11:00,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:11:00,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:00" (1/1) ... [2025-03-16 22:11:00,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:00" (1/1) ... [2025-03-16 22:11:01,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:00" (1/1) ... [2025-03-16 22:11:01,027 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-03-16 22:11:01,031 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:00" (1/1) ... [2025-03-16 22:11:01,032 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:00" (1/1) ... [2025-03-16 22:11:01,052 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:00" (1/1) ... [2025-03-16 22:11:01,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:00" (1/1) ... [2025-03-16 22:11:01,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:00" (1/1) ... [2025-03-16 22:11:01,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:00" (1/1) ... [2025-03-16 22:11:01,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:11:01,076 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:11:01,077 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:11:01,077 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:11:01,078 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:00" (1/1) ... [2025-03-16 22:11:01,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:11:01,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:11:01,102 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) [2025-03-16 22:11:01,105 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 [2025-03-16 22:11:01,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:11:01,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:11:01,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 22:11:01,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:11:01,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:11:01,213 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:11:01,214 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:11:01,870 INFO L? ?]: Removed 295 outVars from TransFormulas that were not future-live. [2025-03-16 22:11:01,870 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:11:01,919 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:11:01,919 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:11:01,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:11:01 BoogieIcfgContainer [2025-03-16 22:11:01,920 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:11:01,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:11:01,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:11:01,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:11:01,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:11:00" (1/3) ... [2025-03-16 22:11:01,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d52adf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:11:01, skipping insertion in model container [2025-03-16 22:11:01,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:00" (2/3) ... [2025-03-16 22:11:01,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d52adf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:11:01, skipping insertion in model container [2025-03-16 22:11:01,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:11:01" (3/3) ... [2025-03-16 22:11:01,926 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul4.c [2025-03-16 22:11:01,936 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:11:01,938 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.mul4.c that has 1 procedures, 180 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:11:01,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:11:01,980 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;@367242fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:11:01,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:11:01,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 180 states, 178 states have (on average 1.5) internal successors, (267), 179 states have internal predecessors, (267), 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) [2025-03-16 22:11:01,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 22:11:01,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:01,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:11:01,993 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:01,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:01,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1722693615, now seen corresponding path program 1 times [2025-03-16 22:11:02,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:02,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858298696] [2025-03-16 22:11:02,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:02,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:02,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 22:11:02,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 22:11:02,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:02,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:02,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:11:02,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:11:02,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858298696] [2025-03-16 22:11:02,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858298696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:02,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:02,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:11:02,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389188469] [2025-03-16 22:11:02,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:02,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:11:02,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:11:02,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:11:02,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:11:02,668 INFO L87 Difference]: Start difference. First operand has 180 states, 178 states have (on average 1.5) internal successors, (267), 179 states have internal predecessors, (267), 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 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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) [2025-03-16 22:11:02,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:02,793 INFO L93 Difference]: Finished difference Result 295 states and 439 transitions. [2025-03-16 22:11:02,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:11:02,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2025-03-16 22:11:02,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:02,802 INFO L225 Difference]: With dead ends: 295 [2025-03-16 22:11:02,802 INFO L226 Difference]: Without dead ends: 180 [2025-03-16 22:11:02,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:11:02,807 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:02,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 652 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:11:02,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-16 22:11:02,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-16 22:11:02,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.4860335195530727) internal successors, (266), 179 states have internal predecessors, (266), 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) [2025-03-16 22:11:02,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 266 transitions. [2025-03-16 22:11:02,835 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 266 transitions. Word has length 64 [2025-03-16 22:11:02,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:02,836 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 266 transitions. [2025-03-16 22:11:02,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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) [2025-03-16 22:11:02,836 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 266 transitions. [2025-03-16 22:11:02,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 22:11:02,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:02,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:11:02,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:11:02,838 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:02,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:02,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1859215279, now seen corresponding path program 1 times [2025-03-16 22:11:02,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:02,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089507433] [2025-03-16 22:11:02,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:02,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:02,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 22:11:02,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 22:11:02,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:02,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:11:03,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:11:03,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089507433] [2025-03-16 22:11:03,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089507433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:03,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:03,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:11:03,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420837855] [2025-03-16 22:11:03,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:03,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:11:03,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:11:03,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:11:03,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:11:03,030 INFO L87 Difference]: Start difference. First operand 180 states and 266 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2025-03-16 22:11:03,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:03,126 INFO L93 Difference]: Finished difference Result 297 states and 438 transitions. [2025-03-16 22:11:03,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:11:03,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2025-03-16 22:11:03,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:03,129 INFO L225 Difference]: With dead ends: 297 [2025-03-16 22:11:03,130 INFO L226 Difference]: Without dead ends: 182 [2025-03-16 22:11:03,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:11:03,131 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:03,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 649 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:11:03,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-16 22:11:03,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-03-16 22:11:03,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.4806629834254144) internal successors, (268), 181 states have internal predecessors, (268), 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) [2025-03-16 22:11:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 268 transitions. [2025-03-16 22:11:03,143 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 268 transitions. Word has length 65 [2025-03-16 22:11:03,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:03,143 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 268 transitions. [2025-03-16 22:11:03,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2025-03-16 22:11:03,143 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 268 transitions. [2025-03-16 22:11:03,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 22:11:03,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:03,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:11:03,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:11:03,146 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:03,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:03,149 INFO L85 PathProgramCache]: Analyzing trace with hash 130410508, now seen corresponding path program 1 times [2025-03-16 22:11:03,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:03,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213505618] [2025-03-16 22:11:03,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:03,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:03,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 22:11:03,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 22:11:03,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:03,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:03,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:11:03,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:11:03,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213505618] [2025-03-16 22:11:03,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213505618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:03,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:03,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:11:03,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645633910] [2025-03-16 22:11:03,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:03,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:11:03,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:11:03,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:11:03,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:11:03,469 INFO L87 Difference]: Start difference. First operand 182 states and 268 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 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) [2025-03-16 22:11:03,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:03,595 INFO L93 Difference]: Finished difference Result 303 states and 445 transitions. [2025-03-16 22:11:03,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:11:03,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2025-03-16 22:11:03,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:03,597 INFO L225 Difference]: With dead ends: 303 [2025-03-16 22:11:03,599 INFO L226 Difference]: Without dead ends: 186 [2025-03-16 22:11:03,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:11:03,600 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 212 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:03,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 647 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:11:03,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-16 22:11:03,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2025-03-16 22:11:03,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.4728260869565217) internal successors, (271), 184 states have internal predecessors, (271), 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) [2025-03-16 22:11:03,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 271 transitions. [2025-03-16 22:11:03,610 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 271 transitions. Word has length 66 [2025-03-16 22:11:03,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:03,610 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 271 transitions. [2025-03-16 22:11:03,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 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) [2025-03-16 22:11:03,611 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 271 transitions. [2025-03-16 22:11:03,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 22:11:03,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:03,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:11:03,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:11:03,614 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:03,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:03,616 INFO L85 PathProgramCache]: Analyzing trace with hash -256724736, now seen corresponding path program 1 times [2025-03-16 22:11:03,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:03,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707235209] [2025-03-16 22:11:03,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:03,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:03,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 22:11:03,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 22:11:03,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:03,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:11:04,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:11:04,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707235209] [2025-03-16 22:11:04,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707235209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:04,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:04,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 22:11:04,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610487162] [2025-03-16 22:11:04,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:04,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 22:11:04,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:11:04,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 22:11:04,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:11:04,383 INFO L87 Difference]: Start difference. First operand 185 states and 271 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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) [2025-03-16 22:11:04,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:04,550 INFO L93 Difference]: Finished difference Result 328 states and 478 transitions. [2025-03-16 22:11:04,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 22:11:04,551 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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 67 [2025-03-16 22:11:04,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:04,553 INFO L225 Difference]: With dead ends: 328 [2025-03-16 22:11:04,553 INFO L226 Difference]: Without dead ends: 208 [2025-03-16 22:11:04,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:11:04,554 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 24 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:04,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1070 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:11:04,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-16 22:11:04,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 193. [2025-03-16 22:11:04,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.46875) internal successors, (282), 192 states have internal predecessors, (282), 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) [2025-03-16 22:11:04,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 282 transitions. [2025-03-16 22:11:04,559 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 282 transitions. Word has length 67 [2025-03-16 22:11:04,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:04,559 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 282 transitions. [2025-03-16 22:11:04,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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) [2025-03-16 22:11:04,560 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 282 transitions. [2025-03-16 22:11:04,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 22:11:04,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:04,560 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:11:04,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:11:04,560 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:04,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:04,561 INFO L85 PathProgramCache]: Analyzing trace with hash 742000354, now seen corresponding path program 1 times [2025-03-16 22:11:04,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:04,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408023302] [2025-03-16 22:11:04,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:04,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:04,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 22:11:04,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 22:11:04,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:04,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:11:04,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:11:04,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408023302] [2025-03-16 22:11:04,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408023302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:04,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:04,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:11:04,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740018893] [2025-03-16 22:11:04,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:04,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:11:04,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:11:04,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:11:04,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:11:04,822 INFO L87 Difference]: Start difference. First operand 193 states and 282 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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) [2025-03-16 22:11:04,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:04,971 INFO L93 Difference]: Finished difference Result 439 states and 637 transitions. [2025-03-16 22:11:04,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:11:04,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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 68 [2025-03-16 22:11:04,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:04,972 INFO L225 Difference]: With dead ends: 439 [2025-03-16 22:11:04,972 INFO L226 Difference]: Without dead ends: 311 [2025-03-16 22:11:04,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:11:04,973 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 504 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:04,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 633 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:11:04,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-16 22:11:04,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 229. [2025-03-16 22:11:04,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.4649122807017543) internal successors, (334), 228 states have internal predecessors, (334), 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) [2025-03-16 22:11:04,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 334 transitions. [2025-03-16 22:11:04,986 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 334 transitions. Word has length 68 [2025-03-16 22:11:04,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:04,986 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 334 transitions. [2025-03-16 22:11:04,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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) [2025-03-16 22:11:04,986 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 334 transitions. [2025-03-16 22:11:04,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 22:11:04,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:04,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:11:04,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 22:11:04,987 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:04,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:04,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1764487321, now seen corresponding path program 1 times [2025-03-16 22:11:04,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:04,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924641835] [2025-03-16 22:11:04,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:04,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:05,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 22:11:05,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 22:11:05,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:05,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:05,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:11:05,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:11:05,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924641835] [2025-03-16 22:11:05,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924641835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:05,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:05,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 22:11:05,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467912435] [2025-03-16 22:11:05,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:05,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:11:05,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:11:05,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:11:05,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:11:05,446 INFO L87 Difference]: Start difference. First operand 229 states and 334 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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) [2025-03-16 22:11:05,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:05,663 INFO L93 Difference]: Finished difference Result 375 states and 545 transitions. [2025-03-16 22:11:05,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 22:11:05,663 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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 68 [2025-03-16 22:11:05,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:05,664 INFO L225 Difference]: With dead ends: 375 [2025-03-16 22:11:05,665 INFO L226 Difference]: Without dead ends: 247 [2025-03-16 22:11:05,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:11:05,666 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 21 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:05,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1472 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:11:05,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-16 22:11:05,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 235. [2025-03-16 22:11:05,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.4615384615384615) internal successors, (342), 234 states have internal predecessors, (342), 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) [2025-03-16 22:11:05,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 342 transitions. [2025-03-16 22:11:05,680 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 342 transitions. Word has length 68 [2025-03-16 22:11:05,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:05,680 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 342 transitions. [2025-03-16 22:11:05,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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) [2025-03-16 22:11:05,680 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 342 transitions. [2025-03-16 22:11:05,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 22:11:05,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:05,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:11:05,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 22:11:05,682 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:05,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:05,682 INFO L85 PathProgramCache]: Analyzing trace with hash 128358461, now seen corresponding path program 1 times [2025-03-16 22:11:05,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:05,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247994738] [2025-03-16 22:11:05,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:05,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:05,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 22:11:05,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 22:11:05,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:05,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:05,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:11:05,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:11:05,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247994738] [2025-03-16 22:11:05,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247994738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:05,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:05,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:11:05,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141504567] [2025-03-16 22:11:05,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:05,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:11:05,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:11:05,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:11:05,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:11:05,982 INFO L87 Difference]: Start difference. First operand 235 states and 342 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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) [2025-03-16 22:11:06,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:06,115 INFO L93 Difference]: Finished difference Result 367 states and 533 transitions. [2025-03-16 22:11:06,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:11:06,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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 68 [2025-03-16 22:11:06,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:06,116 INFO L225 Difference]: With dead ends: 367 [2025-03-16 22:11:06,116 INFO L226 Difference]: Without dead ends: 233 [2025-03-16 22:11:06,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:11:06,118 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 204 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:06,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 842 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:11:06,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-16 22:11:06,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2025-03-16 22:11:06,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.462882096069869) internal successors, (335), 229 states have internal predecessors, (335), 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) [2025-03-16 22:11:06,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 335 transitions. [2025-03-16 22:11:06,126 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 335 transitions. Word has length 68 [2025-03-16 22:11:06,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:06,126 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 335 transitions. [2025-03-16 22:11:06,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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) [2025-03-16 22:11:06,127 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 335 transitions. [2025-03-16 22:11:06,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 22:11:06,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:06,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:11:06,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 22:11:06,128 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:06,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:06,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2973, now seen corresponding path program 1 times [2025-03-16 22:11:06,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:06,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483339976] [2025-03-16 22:11:06,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:06,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:06,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 22:11:06,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 22:11:06,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:06,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:06,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:11:06,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:11:06,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483339976] [2025-03-16 22:11:06,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483339976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:06,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:06,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:11:06,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767186252] [2025-03-16 22:11:06,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:06,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:11:06,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:11:06,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:11:06,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:11:06,328 INFO L87 Difference]: Start difference. First operand 230 states and 335 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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) [2025-03-16 22:11:06,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:06,492 INFO L93 Difference]: Finished difference Result 400 states and 574 transitions. [2025-03-16 22:11:06,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:11:06,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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 68 [2025-03-16 22:11:06,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:06,494 INFO L225 Difference]: With dead ends: 400 [2025-03-16 22:11:06,495 INFO L226 Difference]: Without dead ends: 267 [2025-03-16 22:11:06,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:11:06,496 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 296 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:06,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 629 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:11:06,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-16 22:11:06,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 228. [2025-03-16 22:11:06,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.4537444933920705) internal successors, (330), 227 states have internal predecessors, (330), 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) [2025-03-16 22:11:06,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 330 transitions. [2025-03-16 22:11:06,504 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 330 transitions. Word has length 68 [2025-03-16 22:11:06,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:06,504 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 330 transitions. [2025-03-16 22:11:06,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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) [2025-03-16 22:11:06,506 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 330 transitions. [2025-03-16 22:11:06,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 22:11:06,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:06,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:11:06,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 22:11:06,506 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:06,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:06,507 INFO L85 PathProgramCache]: Analyzing trace with hash -94909032, now seen corresponding path program 1 times [2025-03-16 22:11:06,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:06,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874468818] [2025-03-16 22:11:06,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:06,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:06,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 22:11:06,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 22:11:06,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:06,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:06,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:11:06,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:11:06,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874468818] [2025-03-16 22:11:06,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874468818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:06,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:06,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:11:06,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781707276] [2025-03-16 22:11:06,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:06,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:11:06,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:11:06,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:11:06,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:11:06,707 INFO L87 Difference]: Start difference. First operand 228 states and 330 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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) [2025-03-16 22:11:06,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:06,823 INFO L93 Difference]: Finished difference Result 432 states and 619 transitions. [2025-03-16 22:11:06,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:11:06,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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 68 [2025-03-16 22:11:06,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:06,825 INFO L225 Difference]: With dead ends: 432 [2025-03-16 22:11:06,826 INFO L226 Difference]: Without dead ends: 297 [2025-03-16 22:11:06,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:11:06,826 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 342 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:06,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 633 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:11:06,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-16 22:11:06,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 226. [2025-03-16 22:11:06,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.4444444444444444) internal successors, (325), 225 states have internal predecessors, (325), 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) [2025-03-16 22:11:06,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 325 transitions. [2025-03-16 22:11:06,836 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 325 transitions. Word has length 68 [2025-03-16 22:11:06,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:06,836 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 325 transitions. [2025-03-16 22:11:06,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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) [2025-03-16 22:11:06,836 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 325 transitions. [2025-03-16 22:11:06,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 22:11:06,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:06,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:11:06,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 22:11:06,837 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:06,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:06,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1111032621, now seen corresponding path program 1 times [2025-03-16 22:11:06,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:06,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931960920] [2025-03-16 22:11:06,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:06,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:06,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 22:11:06,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 22:11:06,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:06,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:07,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:11:07,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:11:07,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931960920] [2025-03-16 22:11:07,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931960920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:07,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:07,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:11:07,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275479599] [2025-03-16 22:11:07,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:07,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:11:07,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:11:07,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:11:07,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:11:07,039 INFO L87 Difference]: Start difference. First operand 226 states and 325 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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) [2025-03-16 22:11:07,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:07,146 INFO L93 Difference]: Finished difference Result 355 states and 511 transitions. [2025-03-16 22:11:07,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:11:07,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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 68 [2025-03-16 22:11:07,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:07,147 INFO L225 Difference]: With dead ends: 355 [2025-03-16 22:11:07,147 INFO L226 Difference]: Without dead ends: 218 [2025-03-16 22:11:07,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:11:07,148 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 247 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:07,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 631 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:11:07,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-16 22:11:07,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-03-16 22:11:07,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 1.4516129032258065) internal successors, (315), 217 states have internal predecessors, (315), 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) [2025-03-16 22:11:07,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 315 transitions. [2025-03-16 22:11:07,154 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 315 transitions. Word has length 68 [2025-03-16 22:11:07,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:07,154 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 315 transitions. [2025-03-16 22:11:07,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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) [2025-03-16 22:11:07,154 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 315 transitions. [2025-03-16 22:11:07,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 22:11:07,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:07,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:11:07,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 22:11:07,155 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:07,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:07,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1258626139, now seen corresponding path program 1 times [2025-03-16 22:11:07,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:07,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58120721] [2025-03-16 22:11:07,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:07,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:07,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 22:11:07,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 22:11:07,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:07,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:07,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:11:07,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:11:07,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58120721] [2025-03-16 22:11:07,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58120721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:07,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:07,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:11:07,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995957006] [2025-03-16 22:11:07,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:07,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:11:07,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:11:07,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:11:07,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:11:07,344 INFO L87 Difference]: Start difference. First operand 218 states and 315 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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) [2025-03-16 22:11:07,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:07,464 INFO L93 Difference]: Finished difference Result 386 states and 552 transitions. [2025-03-16 22:11:07,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:11:07,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 69 [2025-03-16 22:11:07,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:07,465 INFO L225 Difference]: With dead ends: 386 [2025-03-16 22:11:07,465 INFO L226 Difference]: Without dead ends: 257 [2025-03-16 22:11:07,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:11:07,466 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 282 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:07,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 629 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:11:07,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-16 22:11:07,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 226. [2025-03-16 22:11:07,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.44) internal successors, (324), 225 states have internal predecessors, (324), 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) [2025-03-16 22:11:07,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 324 transitions. [2025-03-16 22:11:07,471 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 324 transitions. Word has length 69 [2025-03-16 22:11:07,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:07,471 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 324 transitions. [2025-03-16 22:11:07,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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) [2025-03-16 22:11:07,471 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 324 transitions. [2025-03-16 22:11:07,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 22:11:07,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:07,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:11:07,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 22:11:07,472 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:07,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:07,472 INFO L85 PathProgramCache]: Analyzing trace with hash -320338193, now seen corresponding path program 1 times [2025-03-16 22:11:07,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:11:07,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977016904] [2025-03-16 22:11:07,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:07,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:11:07,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 22:11:07,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 22:11:07,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:07,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:11:07,507 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 22:11:07,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 22:11:07,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 22:11:07,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:07,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:11:07,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 22:11:07,583 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 22:11:07,584 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 22:11:07,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 22:11:07,588 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:11:07,629 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 22:11:07,644 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 22:11:07,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 10:11:07 BoogieIcfgContainer [2025-03-16 22:11:07,647 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 22:11:07,647 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 22:11:07,648 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 22:11:07,648 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 22:11:07,649 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:11:01" (3/4) ... [2025-03-16 22:11:07,650 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 22:11:07,651 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 22:11:07,651 INFO L158 Benchmark]: Toolchain (without parser) took 7022.78ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 111.1MB in the beginning and 289.5MB in the end (delta: -178.5MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2025-03-16 22:11:07,651 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:11:07,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.93ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 94.5MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 22:11:07,653 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.92ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 85.2MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:11:07,653 INFO L158 Benchmark]: Boogie Preprocessor took 92.14ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 80.5MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:11:07,653 INFO L158 Benchmark]: IcfgBuilder took 843.71ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 72.0MB in the end (delta: 8.5MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. [2025-03-16 22:11:07,653 INFO L158 Benchmark]: TraceAbstraction took 5725.21ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 71.3MB in the beginning and 289.6MB in the end (delta: -218.3MB). Peak memory consumption was 161.6MB. Max. memory is 16.1GB. [2025-03-16 22:11:07,653 INFO L158 Benchmark]: Witness Printer took 3.53ms. Allocated memory is still 343.9MB. Free memory was 289.6MB in the beginning and 289.5MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:11:07,654 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 201.3MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.93ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 94.5MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.92ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 85.2MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.14ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 80.5MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 843.71ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 72.0MB in the end (delta: 8.5MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5725.21ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 71.3MB in the beginning and 289.6MB in the end (delta: -218.3MB). Peak memory consumption was 161.6MB. Max. memory is 16.1GB. * Witness Printer took 3.53ms. Allocated memory is still 343.9MB. Free memory was 289.6MB in the beginning and 289.5MB in the end (delta: 69.1kB). 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 168. 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 - 32); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (32 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 64); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (64 - 1); [L35] const SORT_64 mask_SORT_64 = (SORT_64)-1 >> (sizeof(SORT_64) * 8 - 4); [L36] const SORT_64 msb_SORT_64 = (SORT_64)1 << (4 - 1); [L38] const SORT_66 mask_SORT_66 = (SORT_66)-1 >> (sizeof(SORT_66) * 8 - 60); [L39] const SORT_66 msb_SORT_66 = (SORT_66)1 << (60 - 1); [L41] const SORT_10 var_11 = 0; [L42] const SORT_1 var_14 = 0; [L43] const SORT_3 var_24 = 0; [L44] const SORT_1 var_51 = 1; [L45] const SORT_64 var_65 = 0; [L47] SORT_1 input_2; [L48] SORT_3 input_4; [L49] SORT_3 input_5; [L50] SORT_1 input_6; [L51] SORT_1 input_7; [L52] SORT_1 input_8; [L53] SORT_1 input_9; [L55] EXPR __VERIFIER_nondet_ulong() & mask_SORT_10 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L55] SORT_10 state_12 = __VERIFIER_nondet_ulong() & mask_SORT_10; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L56] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_ulong() & mask_SORT_10 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L57] SORT_10 state_18 = __VERIFIER_nondet_ulong() & mask_SORT_10; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L58] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L59] SORT_3 state_25 = __VERIFIER_nondet_uint() & mask_SORT_3; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L60] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L61] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L61] SORT_3 state_30 = __VERIFIER_nondet_uint() & mask_SORT_3; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L62] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L63] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L63] SORT_3 state_37 = __VERIFIER_nondet_uint() & mask_SORT_3; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L64] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L65] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L65] SORT_3 state_42 = __VERIFIER_nondet_uint() & mask_SORT_3; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L66] SORT_1 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L67] SORT_1 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L68] SORT_1 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L69] SORT_1 state_87 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L70] SORT_1 state_92 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L72] SORT_10 init_13_arg_1 = var_11; [L73] state_12 = init_13_arg_1 [L74] SORT_1 init_16_arg_1 = var_14; [L75] state_15 = init_16_arg_1 [L76] SORT_10 init_19_arg_1 = var_11; [L77] state_18 = init_19_arg_1 [L78] SORT_1 init_21_arg_1 = var_14; [L79] state_20 = init_21_arg_1 [L80] SORT_3 init_26_arg_1 = var_24; [L81] state_25 = init_26_arg_1 [L82] SORT_1 init_28_arg_1 = var_14; [L83] state_27 = init_28_arg_1 [L84] SORT_3 init_31_arg_1 = var_24; [L85] state_30 = init_31_arg_1 [L86] SORT_1 init_33_arg_1 = var_14; [L87] state_32 = init_33_arg_1 [L88] SORT_3 init_38_arg_1 = var_24; [L89] state_37 = init_38_arg_1 [L90] SORT_1 init_40_arg_1 = var_14; [L91] state_39 = init_40_arg_1 [L92] SORT_3 init_43_arg_1 = var_24; [L93] state_42 = init_43_arg_1 [L94] SORT_1 init_45_arg_1 = var_14; [L95] state_44 = init_45_arg_1 [L96] SORT_1 init_70_arg_1 = var_14; [L97] state_69 = init_70_arg_1 [L98] SORT_1 init_75_arg_1 = var_14; [L99] state_74 = init_75_arg_1 [L100] SORT_1 init_88_arg_1 = var_14; [L101] state_87 = init_88_arg_1 [L102] SORT_1 init_93_arg_1 = var_14; [L103] state_92 = init_93_arg_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L106] input_2 = __VERIFIER_nondet_uchar() [L107] input_4 = __VERIFIER_nondet_uint() [L108] input_5 = __VERIFIER_nondet_uint() [L109] input_6 = __VERIFIER_nondet_uchar() [L110] EXPR input_6 & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L110] input_6 = input_6 & mask_SORT_1 [L111] input_7 = __VERIFIER_nondet_uchar() [L112] EXPR input_7 & mask_SORT_1 VAL [input_6=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L112] input_7 = input_7 & mask_SORT_1 [L113] input_8 = __VERIFIER_nondet_uchar() [L114] EXPR input_8 & mask_SORT_1 VAL [input_6=0, input_7=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L114] input_8 = input_8 & mask_SORT_1 [L115] input_9 = __VERIFIER_nondet_uchar() [L116] EXPR input_9 & mask_SORT_1 VAL [input_6=0, input_7=0, input_8=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L116] input_9 = input_9 & mask_SORT_1 [L119] SORT_1 var_17_arg_0 = state_15; [L120] SORT_10 var_17_arg_1 = state_12; [L121] SORT_10 var_17_arg_2 = var_11; [L122] SORT_10 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_17=0, var_24=0, var_51=1, var_65=0] [L123] EXPR var_17 & mask_SORT_10 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L123] var_17 = var_17 & mask_SORT_10 [L124] SORT_1 var_22_arg_0 = state_20; [L125] SORT_10 var_22_arg_1 = state_18; [L126] SORT_10 var_22_arg_2 = var_11; [L127] SORT_10 var_22 = var_22_arg_0 ? var_22_arg_1 : var_22_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_17=0, var_22=0, var_24=0, var_51=1, var_65=0] [L128] EXPR var_22 & mask_SORT_10 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_17=0, var_24=0, var_51=1, var_65=0] [L128] var_22 = var_22 & mask_SORT_10 [L129] SORT_10 var_23_arg_0 = var_17; [L130] SORT_10 var_23_arg_1 = var_22; [L131] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L132] SORT_1 var_29_arg_0 = state_27; [L133] SORT_3 var_29_arg_1 = state_25; [L134] SORT_3 var_29_arg_2 = var_24; [L135] SORT_3 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_29=0, var_51=1, var_65=0] [L136] EXPR var_29 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_51=1, var_65=0] [L136] var_29 = var_29 & mask_SORT_3 [L137] SORT_1 var_34_arg_0 = state_32; [L138] SORT_3 var_34_arg_1 = state_30; [L139] SORT_3 var_34_arg_2 = var_24; [L140] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_29=0, var_34=0, var_51=1, var_65=0] [L141] EXPR var_34 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_29=0, var_51=1, var_65=0] [L141] var_34 = var_34 & mask_SORT_3 [L142] SORT_3 var_35_arg_0 = var_29; [L143] SORT_3 var_35_arg_1 = var_34; [L144] SORT_1 var_35 = var_35_arg_0 == var_35_arg_1; [L145] SORT_1 var_36_arg_0 = var_23; [L146] SORT_1 var_36_arg_1 = var_35; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36_arg_0=1, var_36_arg_1=1, var_51=1, var_65=0] [L147] EXPR var_36_arg_0 & var_36_arg_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L147] SORT_1 var_36 = var_36_arg_0 & var_36_arg_1; [L148] SORT_1 var_41_arg_0 = state_39; [L149] SORT_3 var_41_arg_1 = state_37; [L150] SORT_3 var_41_arg_2 = var_24; [L151] SORT_3 var_41 = var_41_arg_0 ? var_41_arg_1 : var_41_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_41=0, var_51=1, var_65=0] [L152] EXPR var_41 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_51=1, var_65=0] [L152] var_41 = var_41 & mask_SORT_3 [L153] SORT_1 var_46_arg_0 = state_44; [L154] SORT_3 var_46_arg_1 = state_42; [L155] SORT_3 var_46_arg_2 = var_24; [L156] SORT_3 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_41=0, var_46=0, var_51=1, var_65=0] [L157] EXPR var_46 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_41=0, var_51=1, var_65=0] [L157] var_46 = var_46 & mask_SORT_3 [L158] SORT_3 var_47_arg_0 = var_41; [L159] SORT_3 var_47_arg_1 = var_46; [L160] SORT_1 var_47 = var_47_arg_0 == var_47_arg_1; [L161] SORT_1 var_48_arg_0 = var_36; [L162] SORT_1 var_48_arg_1 = var_47; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_48_arg_0=1, var_48_arg_1=1, var_51=1, var_65=0] [L163] EXPR var_48_arg_0 & var_48_arg_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L163] SORT_1 var_48 = var_48_arg_0 & var_48_arg_1; [L164] SORT_1 var_52_arg_0 = var_48; [L165] SORT_1 var_52 = ~var_52_arg_0; [L166] SORT_1 var_53_arg_0 = var_51; [L167] SORT_1 var_53_arg_1 = var_52; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_53_arg_0=1, var_53_arg_1=-2, var_65=0] [L168] EXPR var_53_arg_0 & var_53_arg_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L168] SORT_1 var_53 = var_53_arg_0 & var_53_arg_1; [L169] EXPR var_53 & mask_SORT_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L169] var_53 = var_53 & mask_SORT_1 [L170] SORT_1 bad_54_arg_0 = var_53; [L171] CALL __VERIFIER_assert(!(bad_54_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 180 locations, 267 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2132 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2132 mSDsluCounter, 8487 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6129 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2073 IncrementalHoareTripleChecker+Invalid, 2082 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 2358 mSDtfsCounter, 2073 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235occurred in iteration=6, InterpolantAutomatonStates: 63, 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, 11 MinimizatonAttempts, 254 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 728 ConstructedInterpolants, 0 QuantifiedInterpolants, 1919 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-16 22:11:07,674 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/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.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 a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:11:09,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:11:09,521 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-16 22:11:09,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:11:09,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:11:09,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:11:09,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:11:09,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:11:09,549 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:11:09,549 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:11:09,550 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:11:09,550 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:11:09,550 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:11:09,550 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:11:09,550 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:11:09,551 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:11:09,551 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:11:09,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:11:09,551 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:11:09,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:11:09,551 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:11:09,551 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 22:11:09,551 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 22:11:09,551 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 22:11:09,551 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:11:09,551 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:11:09,551 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:11:09,551 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:11:09,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:11:09,551 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:11:09,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:11:09,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:11:09,551 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:11:09,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:11:09,552 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:11:09,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:11:09,552 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 22:11:09,552 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 22:11:09,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:11:09,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:11:09,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:11:09,553 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:11:09,553 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b [2025-03-16 22:11:09,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:11:09,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:11:09,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:11:09,780 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:11:09,781 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:11:09,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2025-03-16 22:11:10,930 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a256d79c7/9389a95cf70541d893bbf062c2b635a1/FLAG96736c0b3 [2025-03-16 22:11:11,126 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:11:11,127 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2025-03-16 22:11:11,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a256d79c7/9389a95cf70541d893bbf062c2b635a1/FLAG96736c0b3 [2025-03-16 22:11:11,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a256d79c7/9389a95cf70541d893bbf062c2b635a1 [2025-03-16 22:11:11,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:11:11,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:11:11,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:11:11,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:11:11,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:11:11,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:11:11" (1/1) ... [2025-03-16 22:11:11,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c6d4644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:11, skipping insertion in model container [2025-03-16 22:11:11,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:11:11" (1/1) ... [2025-03-16 22:11:11,504 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:11:11,601 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2025-03-16 22:11:11,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:11:11,664 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:11:11,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2025-03-16 22:11:11,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:11:11,710 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:11:11,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:11 WrapperNode [2025-03-16 22:11:11,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:11:11,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:11:11,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:11:11,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:11:11,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:11" (1/1) ... [2025-03-16 22:11:11,723 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:11" (1/1) ... [2025-03-16 22:11:11,743 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 298 [2025-03-16 22:11:11,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:11:11,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:11:11,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:11:11,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:11:11,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:11" (1/1) ... [2025-03-16 22:11:11,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:11" (1/1) ... [2025-03-16 22:11:11,753 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:11" (1/1) ... [2025-03-16 22:11:11,765 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-03-16 22:11:11,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:11" (1/1) ... [2025-03-16 22:11:11,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:11" (1/1) ... [2025-03-16 22:11:11,774 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:11" (1/1) ... [2025-03-16 22:11:11,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:11" (1/1) ... [2025-03-16 22:11:11,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:11" (1/1) ... [2025-03-16 22:11:11,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:11" (1/1) ... [2025-03-16 22:11:11,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:11:11,784 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:11:11,785 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:11:11,785 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:11:11,786 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:11" (1/1) ... [2025-03-16 22:11:11,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:11:11,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:11:11,809 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) [2025-03-16 22:11:11,813 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 [2025-03-16 22:11:11,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:11:11,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 22:11:11,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-16 22:11:11,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:11:11,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:11:11,920 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:11:11,921 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:11:12,261 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-16 22:11:12,262 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:11:12,270 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:11:12,270 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:11:12,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:11:12 BoogieIcfgContainer [2025-03-16 22:11:12,271 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:11:12,273 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:11:12,273 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:11:12,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:11:12,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:11:11" (1/3) ... [2025-03-16 22:11:12,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2009b5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:11:12, skipping insertion in model container [2025-03-16 22:11:12,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:11:11" (2/3) ... [2025-03-16 22:11:12,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2009b5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:11:12, skipping insertion in model container [2025-03-16 22:11:12,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:11:12" (3/3) ... [2025-03-16 22:11:12,279 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul4.c [2025-03-16 22:11:12,288 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:11:12,289 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.mul4.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:11:12,319 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:11:12,325 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;@75ea747b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:11:12,326 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:11:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:11:12,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 22:11:12,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:12,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 22:11:12,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:12,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:12,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-03-16 22:11:12,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:11:12,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2134350014] [2025-03-16 22:11:12,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:12,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:11:12,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:11:12,346 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:11:12,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 22:11:12,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 22:11:12,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 22:11:12,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:12,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:12,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-16 22:11:12,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:11:12,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:11:12,876 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:11:12,877 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:11:12,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134350014] [2025-03-16 22:11:12,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134350014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:11:12,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:11:12,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:11:12,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100022192] [2025-03-16 22:11:12,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:11:12,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:11:12,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:11:12,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:11:12,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:11:12,894 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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) [2025-03-16 22:11:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:11:13,017 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2025-03-16 22:11:13,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:11:13,018 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 [2025-03-16 22:11:13,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:11:13,022 INFO L225 Difference]: With dead ends: 15 [2025-03-16 22:11:13,022 INFO L226 Difference]: Without dead ends: 8 [2025-03-16 22:11:13,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:11:13,028 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:11:13,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:11:13,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2025-03-16 22:11:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-03-16 22:11:13,046 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) [2025-03-16 22:11:13,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-16 22:11:13,050 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-03-16 22:11:13,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:11:13,050 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-16 22:11:13,050 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) [2025-03-16 22:11:13,050 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-03-16 22:11:13,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 22:11:13,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:11:13,051 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-16 22:11:13,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 22:11:13,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:11:13,255 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:11:13,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:11:13,256 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-03-16 22:11:13,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:11:13,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1963770041] [2025-03-16 22:11:13,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:11:13,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:11:13,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:11:13,259 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:11:13,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 22:11:13,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 22:11:13,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 22:11:13,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:11:13,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:11:13,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-03-16 22:11:13,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:11:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:11:14,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:11:26,830 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse12 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_92~0#1|)) (.cse39 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_74~0#1|))) (let ((.cse40 (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |c_ULTIMATE.start_main_~state_42~0#1|)) (.cse18 (and (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| (_ BitVec 64))) (not (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|)))) .cse39)) (.cse22 (and (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 64))) (not (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|)))) (not .cse39))) (.cse11 (not .cse12)) (.cse38 (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 64))) (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|)))) (.cse37 (and (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| (_ BitVec 64))) (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|))) .cse39)) (.cse29 (forall ((|v_ULTIMATE.start_main_~var_53_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_0~0#1_10|)))))))))) (let ((.cse30 (or .cse37 .cse29)) (.cse33 (or .cse29 .cse38 .cse39)) (.cse9 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_9~0#1|)) (.cse34 (forall ((|v_ULTIMATE.start_main_~var_53_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_0~0#1_10|))))))))) (.cse26 (and (or .cse12 .cse18) (or .cse22 .cse11))) (.cse28 (and (or .cse38 .cse39) (or .cse12 .cse37))) (.cse36 (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 32))) (= .cse40 (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |ULTIMATE.start_main_~input_5~0#1|))) .cse29)) (.cse35 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 32))) (not (= .cse40 (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |ULTIMATE.start_main_~input_5~0#1|)))))) (let ((.cse19 (and .cse36 (or .cse35 .cse29))) (.cse0 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_8~0#1|)) (.cse2 (and (or .cse34 .cse26) (or .cse28 .cse29))) (.cse15 (not .cse9)) (.cse32 (and (or .cse34 .cse22) .cse33)) (.cse31 (and (or .cse34 .cse18) .cse30))) (let ((.cse24 (and (or .cse32 .cse11) (or .cse12 .cse31))) (.cse25 (or .cse2 .cse15)) (.cse3 (not .cse0)) (.cse21 (or .cse38 .cse19 .cse39)) (.cse17 (or .cse37 .cse19)) (.cse27 (and (or .cse34 .cse35) .cse36)) (.cse20 (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_30~0#1_9| (_ BitVec 32))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |ULTIMATE.start_main_~input_4~0#1|) (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |v_ULTIMATE.start_main_~state_30~0#1_9|))))) (.cse16 (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_30~0#1_9| (_ BitVec 32))) (= (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |ULTIMATE.start_main_~input_4~0#1|) (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |v_ULTIMATE.start_main_~state_30~0#1_9|))))) (let ((.cse1 (and (or .cse12 (and (or (and (or .cse29 .cse18) .cse30) .cse16) (or .cse31 .cse20))) (or (and (or .cse32 .cse20) (or (and .cse33 (or .cse22 .cse29)) .cse16)) .cse11))) (.cse13 (and .cse17 (or .cse18 .cse27))) (.cse10 (and .cse21 (or .cse22 .cse27))) (.cse8 (or (and .cse25 (or .cse9 (and (or .cse26 .cse27) (or .cse28 .cse19)))) .cse3)) (.cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_8~0#1|)) (.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_9~0#1|)) (.cse14 (or .cse15 .cse24))) (and (or (and (or .cse0 .cse1) (or .cse2 .cse3)) (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse4 .cse5))) .cse6))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse5 .cse7))))))))))) (or (and .cse8 (or .cse0 (and (or .cse9 (and (or .cse10 .cse11) (or .cse12 .cse13))) .cse14))) (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|))))))) .cse6)))))) (or (and (or .cse0 (and (or .cse15 .cse1) (or .cse9 (and (or .cse12 (and (or .cse16 (and .cse17 (or .cse18 .cse19))) (or .cse13 .cse20))) (or (and (or .cse10 .cse20) (or .cse16 (and .cse21 (or .cse22 .cse19)))) .cse11))))) .cse8) (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse4 .cse23))) .cse6)))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse23 .cse7))))))))))) (or (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|))))))) .cse6)))) (and (or .cse0 (and (or .cse9 .cse24) .cse14)) (or (and .cse25 (or .cse9 .cse2)) .cse3)))))))))) is different from false [2025-03-16 22:12:00,274 WARN L286 SmtUtils]: Spent 16.42s on a formula simplification that was a NOOP. DAG size: 191 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-16 22:12:23,444 WARN L286 SmtUtils]: Spent 6.63s on a formula simplification that was a NOOP. DAG size: 121 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-16 22:12:23,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:12:23,445 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:12:23,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963770041] [2025-03-16 22:12:23,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963770041] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:12:23,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 22:12:23,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-16 22:12:23,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163395037] [2025-03-16 22:12:23,446 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 22:12:23,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 22:12:23,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:12:23,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 22:12:23,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2025-03-16 22:12:23,447 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 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) [2025-03-16 22:12:27,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:12:27,240 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-03-16 22:12:27,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:12:27,243 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 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 [2025-03-16 22:12:27,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:12:27,244 INFO L225 Difference]: With dead ends: 13 [2025-03-16 22:12:27,244 INFO L226 Difference]: Without dead ends: 11 [2025-03-16 22:12:27,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 33.1s TimeCoverageRelationStatistics Valid=43, Invalid=116, Unknown=1, NotChecked=22, Total=182 [2025-03-16 22:12:27,245 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:12:27,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 7 Unchecked, 1.5s Time] [2025-03-16 22:12:27,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-03-16 22:12:27,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-16 22:12:27,247 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) [2025-03-16 22:12:27,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-03-16 22:12:27,248 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-03-16 22:12:27,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:12:27,248 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-03-16 22:12:27,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 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) [2025-03-16 22:12:27,248 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-03-16 22:12:27,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 22:12:27,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:12:27,248 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-03-16 22:12:27,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 22:12:27,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:12:27,449 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:12:27,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:12:27,450 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-03-16 22:12:27,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:12:27,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [798030513] [2025-03-16 22:12:27,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 22:12:27,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:12:27,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:12:27,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:12:27,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 22:12:27,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes.