./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.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 52bb3902ccaac92ca995ec60bcedc54784c82a6cab90a6a11e201a4e0de664cb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:04:49,852 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:04:49,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 03:04:49,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:04:49,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:04:49,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:04:49,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:04:49,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:04:49,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:04:49,982 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:04:49,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:04:49,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:04:49,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:04:49,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:04:49,984 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:04:49,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:04:49,988 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:04:49,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:04:49,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:04:49,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:04:49,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:04:49,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:04:49,990 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:04:49,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:04:49,991 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:04:49,991 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:04:49,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:04:49,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:04:49,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:04:49,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:04:49,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:04:49,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:04:49,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:04:50,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:04:50,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:04:50,001 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:04:50,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:04:50,001 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:04:50,001 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:04:50,001 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52bb3902ccaac92ca995ec60bcedc54784c82a6cab90a6a11e201a4e0de664cb [2024-11-10 03:04:50,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:04:50,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:04:50,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:04:50,279 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:04:50,280 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:04:50,281 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c [2024-11-10 03:04:51,767 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:04:52,033 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:04:52,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c [2024-11-10 03:04:52,052 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb38c87a6/4ad5354dffb44edba4c8bcd30ae10ee3/FLAG0ec5d596e [2024-11-10 03:04:52,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb38c87a6/4ad5354dffb44edba4c8bcd30ae10ee3 [2024-11-10 03:04:52,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:04:52,336 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:04:52,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:04:52,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:04:52,343 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:04:52,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:04:52" (1/1) ... [2024-11-10 03:04:52,344 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7980ba3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:52, skipping insertion in model container [2024-11-10 03:04:52,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:04:52" (1/1) ... [2024-11-10 03:04:52,397 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:04:52,623 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c[1259,1272] [2024-11-10 03:04:52,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:04:52,903 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:04:52,915 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c[1259,1272] [2024-11-10 03:04:53,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:04:53,094 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:04:53,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53 WrapperNode [2024-11-10 03:04:53,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:04:53,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:04:53,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:04:53,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:04:53,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (1/1) ... [2024-11-10 03:04:53,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (1/1) ... [2024-11-10 03:04:53,490 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2148 [2024-11-10 03:04:53,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:04:53,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:04:53,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:04:53,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:04:53,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (1/1) ... [2024-11-10 03:04:53,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (1/1) ... [2024-11-10 03:04:53,547 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (1/1) ... [2024-11-10 03:04:53,704 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:04:53,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (1/1) ... [2024-11-10 03:04:53,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (1/1) ... [2024-11-10 03:04:53,787 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (1/1) ... [2024-11-10 03:04:53,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (1/1) ... [2024-11-10 03:04:53,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (1/1) ... [2024-11-10 03:04:53,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (1/1) ... [2024-11-10 03:04:53,890 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:04:53,891 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:04:53,892 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:04:53,892 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:04:53,893 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (1/1) ... [2024-11-10 03:04:53,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:04:53,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:04:53,936 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:04:53,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:04:54,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:04:54,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:04:54,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:04:54,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:04:54,328 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:04:54,330 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:04:56,567 INFO L? ?]: Removed 1344 outVars from TransFormulas that were not future-live. [2024-11-10 03:04:56,567 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:04:56,699 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:04:56,699 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:04:56,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:04:56 BoogieIcfgContainer [2024-11-10 03:04:56,700 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:04:56,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:04:56,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:04:56,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:04:56,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:04:52" (1/3) ... [2024-11-10 03:04:56,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69cf58b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:04:56, skipping insertion in model container [2024-11-10 03:04:56,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (2/3) ... [2024-11-10 03:04:56,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69cf58b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:04:56, skipping insertion in model container [2024-11-10 03:04:56,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:04:56" (3/3) ... [2024-11-10 03:04:56,712 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p15.c [2024-11-10 03:04:56,732 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:04:56,733 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:04:56,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:04:56,843 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;@1cdc43b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:04:56,844 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:04:56,851 INFO L276 IsEmpty]: Start isEmpty. Operand has 546 states, 544 states have (on average 1.4963235294117647) internal successors, (814), 545 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:04:56,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 03:04:56,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:04:56,865 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:04:56,866 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:04:56,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:04:56,874 INFO L85 PathProgramCache]: Analyzing trace with hash -120664922, now seen corresponding path program 1 times [2024-11-10 03:04:56,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:04:56,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986499895] [2024-11-10 03:04:56,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:04:56,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:04:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:04:57,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:04:57,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:04:57,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986499895] [2024-11-10 03:04:57,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986499895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:04:57,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:04:57,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:04:57,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183622672] [2024-11-10 03:04:57,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:04:57,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:04:57,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:04:57,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:04:57,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:04:57,687 INFO L87 Difference]: Start difference. First operand has 546 states, 544 states have (on average 1.4963235294117647) internal successors, (814), 545 states have internal predecessors, (814), 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 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:04:58,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:04:58,128 INFO L93 Difference]: Finished difference Result 1035 states and 1547 transitions. [2024-11-10 03:04:58,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:04:58,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-10 03:04:58,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:04:58,148 INFO L225 Difference]: With dead ends: 1035 [2024-11-10 03:04:58,149 INFO L226 Difference]: Without dead ends: 543 [2024-11-10 03:04:58,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:04:58,158 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 0 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 03:04:58,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2014 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 03:04:58,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-10 03:04:58,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2024-11-10 03:04:58,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 542 states have (on average 1.4944649446494465) internal successors, (810), 542 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:04:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 810 transitions. [2024-11-10 03:04:58,228 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 810 transitions. Word has length 46 [2024-11-10 03:04:58,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:04:58,228 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 810 transitions. [2024-11-10 03:04:58,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:04:58,229 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 810 transitions. [2024-11-10 03:04:58,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-10 03:04:58,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:04:58,230 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:04:58,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:04:58,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:04:58,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:04:58,232 INFO L85 PathProgramCache]: Analyzing trace with hash 699408884, now seen corresponding path program 1 times [2024-11-10 03:04:58,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:04:58,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174545785] [2024-11-10 03:04:58,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:04:58,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:04:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:04:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:04:58,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:04:58,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174545785] [2024-11-10 03:04:58,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174545785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:04:58,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:04:58,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:04:58,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703261121] [2024-11-10 03:04:58,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:04:58,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:04:58,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:04:58,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:04:58,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:04:58,479 INFO L87 Difference]: Start difference. First operand 543 states and 810 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:04:58,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:04:58,797 INFO L93 Difference]: Finished difference Result 1034 states and 1543 transitions. [2024-11-10 03:04:58,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:04:58,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-10 03:04:58,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:04:58,801 INFO L225 Difference]: With dead ends: 1034 [2024-11-10 03:04:58,804 INFO L226 Difference]: Without dead ends: 545 [2024-11-10 03:04:58,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:04:58,808 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 0 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2011 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:04:58,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2011 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 03:04:58,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-10 03:04:58,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2024-11-10 03:04:58,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 1.4926470588235294) internal successors, (812), 544 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:04:58,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 812 transitions. [2024-11-10 03:04:58,831 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 812 transitions. Word has length 47 [2024-11-10 03:04:58,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:04:58,832 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 812 transitions. [2024-11-10 03:04:58,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:04:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 812 transitions. [2024-11-10 03:04:58,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 03:04:58,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:04:58,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:04:58,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:04:58,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:04:58,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:04:58,835 INFO L85 PathProgramCache]: Analyzing trace with hash -45916725, now seen corresponding path program 1 times [2024-11-10 03:04:58,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:04:58,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296362599] [2024-11-10 03:04:58,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:04:58,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:04:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:04:59,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:04:59,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:04:59,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296362599] [2024-11-10 03:04:59,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296362599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:04:59,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:04:59,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:04:59,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62388742] [2024-11-10 03:04:59,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:04:59,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:04:59,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:04:59,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:04:59,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:04:59,221 INFO L87 Difference]: Start difference. First operand 545 states and 812 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:04:59,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:04:59,556 INFO L93 Difference]: Finished difference Result 1040 states and 1550 transitions. [2024-11-10 03:04:59,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:04:59,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 48 [2024-11-10 03:04:59,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:04:59,559 INFO L225 Difference]: With dead ends: 1040 [2024-11-10 03:04:59,559 INFO L226 Difference]: Without dead ends: 549 [2024-11-10 03:04:59,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:04:59,561 INFO L432 NwaCegarLoop]: 671 mSDtfsCounter, 2 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:04:59,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2007 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 03:04:59,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-11-10 03:04:59,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 547. [2024-11-10 03:04:59,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.4908424908424909) internal successors, (814), 546 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:04:59,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 814 transitions. [2024-11-10 03:04:59,609 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 814 transitions. Word has length 48 [2024-11-10 03:04:59,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:04:59,609 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 814 transitions. [2024-11-10 03:04:59,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:04:59,610 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 814 transitions. [2024-11-10 03:04:59,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 03:04:59,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:04:59,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:04:59,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 03:04:59,612 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:04:59,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:04:59,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1281245007, now seen corresponding path program 1 times [2024-11-10 03:04:59,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:04:59,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371987758] [2024-11-10 03:04:59,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:04:59,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:04:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:04:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:04:59,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:04:59,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371987758] [2024-11-10 03:04:59,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371987758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:04:59,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:04:59,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 03:04:59,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778577302] [2024-11-10 03:04:59,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:04:59,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 03:04:59,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:04:59,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 03:04:59,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 03:04:59,898 INFO L87 Difference]: Start difference. First operand 547 states and 814 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:00,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:05:00,376 INFO L93 Difference]: Finished difference Result 1044 states and 1554 transitions. [2024-11-10 03:05:00,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 03:05:00,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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 49 [2024-11-10 03:05:00,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:05:00,379 INFO L225 Difference]: With dead ends: 1044 [2024-11-10 03:05:00,379 INFO L226 Difference]: Without dead ends: 551 [2024-11-10 03:05:00,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 03:05:00,383 INFO L432 NwaCegarLoop]: 670 mSDtfsCounter, 1 mSDsluCounter, 2667 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3337 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 03:05:00,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3337 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 03:05:00,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-10 03:05:00,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 550. [2024-11-10 03:05:00,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 1.4899817850637522) internal successors, (818), 549 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 818 transitions. [2024-11-10 03:05:00,398 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 818 transitions. Word has length 49 [2024-11-10 03:05:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:05:00,399 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 818 transitions. [2024-11-10 03:05:00,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:00,399 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 818 transitions. [2024-11-10 03:05:00,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 03:05:00,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:05:00,404 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:05:00,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 03:05:00,405 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:05:00,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:05:00,405 INFO L85 PathProgramCache]: Analyzing trace with hash 92679946, now seen corresponding path program 1 times [2024-11-10 03:05:00,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:05:00,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990532778] [2024-11-10 03:05:00,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:05:00,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:05:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:05:00,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:05:00,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:05:00,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990532778] [2024-11-10 03:05:00,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990532778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:05:00,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:05:00,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:05:00,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498985696] [2024-11-10 03:05:00,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:05:00,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:05:00,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:05:00,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:05:00,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:05:00,574 INFO L87 Difference]: Start difference. First operand 550 states and 818 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:00,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:05:00,911 INFO L93 Difference]: Finished difference Result 1052 states and 1565 transitions. [2024-11-10 03:05:00,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:05:00,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 49 [2024-11-10 03:05:00,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:05:00,915 INFO L225 Difference]: With dead ends: 1052 [2024-11-10 03:05:00,915 INFO L226 Difference]: Without dead ends: 556 [2024-11-10 03:05:00,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:05:00,920 INFO L432 NwaCegarLoop]: 672 mSDtfsCounter, 4 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2678 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:05:00,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2678 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 03:05:00,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-10 03:05:00,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-11-10 03:05:00,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 1.4882882882882882) internal successors, (826), 555 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 826 transitions. [2024-11-10 03:05:00,934 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 826 transitions. Word has length 49 [2024-11-10 03:05:00,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:05:00,935 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 826 transitions. [2024-11-10 03:05:00,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:00,937 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 826 transitions. [2024-11-10 03:05:00,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 03:05:00,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:05:00,938 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:05:00,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 03:05:00,938 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:05:00,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:05:00,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1262963052, now seen corresponding path program 1 times [2024-11-10 03:05:00,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:05:00,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937031670] [2024-11-10 03:05:00,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:05:00,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:05:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:05:01,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:05:01,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:05:01,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937031670] [2024-11-10 03:05:01,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937031670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:05:01,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:05:01,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 03:05:01,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173968993] [2024-11-10 03:05:01,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:05:01,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 03:05:01,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:05:01,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 03:05:01,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:05:01,475 INFO L87 Difference]: Start difference. First operand 556 states and 826 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:01,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:05:01,982 INFO L93 Difference]: Finished difference Result 1063 states and 1579 transitions. [2024-11-10 03:05:01,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 03:05:01,983 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 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 50 [2024-11-10 03:05:01,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:05:01,985 INFO L225 Difference]: With dead ends: 1063 [2024-11-10 03:05:01,987 INFO L226 Difference]: Without dead ends: 561 [2024-11-10 03:05:01,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-10 03:05:01,989 INFO L432 NwaCegarLoop]: 665 mSDtfsCounter, 780 mSDsluCounter, 2648 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 3313 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 03:05:01,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 3313 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 03:05:01,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-11-10 03:05:02,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 560. [2024-11-10 03:05:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.486583184257603) internal successors, (831), 559 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:02,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 831 transitions. [2024-11-10 03:05:02,007 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 831 transitions. Word has length 50 [2024-11-10 03:05:02,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:05:02,008 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 831 transitions. [2024-11-10 03:05:02,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 831 transitions. [2024-11-10 03:05:02,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 03:05:02,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:05:02,012 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:05:02,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 03:05:02,013 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:05:02,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:05:02,013 INFO L85 PathProgramCache]: Analyzing trace with hash -794827467, now seen corresponding path program 1 times [2024-11-10 03:05:02,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:05:02,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25577562] [2024-11-10 03:05:02,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:05:02,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:05:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:05:02,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:05:02,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:05:02,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25577562] [2024-11-10 03:05:02,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25577562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:05:02,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:05:02,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:05:02,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341489708] [2024-11-10 03:05:02,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:05:02,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:05:02,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:05:02,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:05:02,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:05:02,304 INFO L87 Difference]: Start difference. First operand 560 states and 831 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:02,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:05:02,678 INFO L93 Difference]: Finished difference Result 1068 states and 1585 transitions. [2024-11-10 03:05:02,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:05:02,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 50 [2024-11-10 03:05:02,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:05:02,681 INFO L225 Difference]: With dead ends: 1068 [2024-11-10 03:05:02,682 INFO L226 Difference]: Without dead ends: 562 [2024-11-10 03:05:02,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 03:05:02,684 INFO L432 NwaCegarLoop]: 670 mSDtfsCounter, 780 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:05:02,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 2002 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 03:05:02,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-10 03:05:02,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2024-11-10 03:05:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 1.4848484848484849) internal successors, (833), 561 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 833 transitions. [2024-11-10 03:05:02,701 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 833 transitions. Word has length 50 [2024-11-10 03:05:02,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:05:02,702 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 833 transitions. [2024-11-10 03:05:02,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:02,703 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 833 transitions. [2024-11-10 03:05:02,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-10 03:05:02,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:05:02,704 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:05:02,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 03:05:02,705 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:05:02,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:05:02,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1015216421, now seen corresponding path program 1 times [2024-11-10 03:05:02,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:05:02,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701735778] [2024-11-10 03:05:02,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:05:02,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:05:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:05:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:05:03,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:05:03,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701735778] [2024-11-10 03:05:03,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701735778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:05:03,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:05:03,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:05:03,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827913614] [2024-11-10 03:05:03,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:05:03,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:05:03,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:05:03,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:05:03,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:05:03,039 INFO L87 Difference]: Start difference. First operand 562 states and 833 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:03,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:05:03,445 INFO L93 Difference]: Finished difference Result 1072 states and 1589 transitions. [2024-11-10 03:05:03,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:05:03,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 51 [2024-11-10 03:05:03,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:05:03,448 INFO L225 Difference]: With dead ends: 1072 [2024-11-10 03:05:03,448 INFO L226 Difference]: Without dead ends: 564 [2024-11-10 03:05:03,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:05:03,449 INFO L432 NwaCegarLoop]: 639 mSDtfsCounter, 778 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 03:05:03,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 1911 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 03:05:03,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2024-11-10 03:05:03,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 562. [2024-11-10 03:05:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 1.4848484848484849) internal successors, (833), 561 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 833 transitions. [2024-11-10 03:05:03,461 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 833 transitions. Word has length 51 [2024-11-10 03:05:03,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:05:03,461 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 833 transitions. [2024-11-10 03:05:03,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:03,462 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 833 transitions. [2024-11-10 03:05:03,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-10 03:05:03,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:05:03,462 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:05:03,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 03:05:03,463 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:05:03,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:05:03,463 INFO L85 PathProgramCache]: Analyzing trace with hash 795163413, now seen corresponding path program 1 times [2024-11-10 03:05:03,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:05:03,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180895053] [2024-11-10 03:05:03,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:05:03,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:05:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:05:03,518 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:05:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:05:03,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:05:03,627 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:05:03,629 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:05:03,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 03:05:03,637 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:05:03,710 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:05:03,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:05:03 BoogieIcfgContainer [2024-11-10 03:05:03,713 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:05:03,714 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:05:03,714 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:05:03,714 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:05:03,717 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:04:56" (3/4) ... [2024-11-10 03:05:03,720 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:05:03,722 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:05:03,723 INFO L158 Benchmark]: Toolchain (without parser) took 11387.41ms. Allocated memory was 167.8MB in the beginning and 559.9MB in the end (delta: 392.2MB). Free memory was 113.8MB in the beginning and 274.3MB in the end (delta: -160.5MB). Peak memory consumption was 233.1MB. Max. memory is 16.1GB. [2024-11-10 03:05:03,724 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 167.8MB. Free memory is still 134.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:05:03,725 INFO L158 Benchmark]: CACSL2BoogieTranslator took 758.08ms. Allocated memory is still 167.8MB. Free memory was 113.8MB in the beginning and 66.3MB in the end (delta: 47.5MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-10 03:05:03,725 INFO L158 Benchmark]: Boogie Procedure Inliner took 394.53ms. Allocated memory is still 167.8MB. Free memory was 66.3MB in the beginning and 96.1MB in the end (delta: -29.8MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2024-11-10 03:05:03,726 INFO L158 Benchmark]: Boogie Preprocessor took 398.99ms. Allocated memory was 167.8MB in the beginning and 274.7MB in the end (delta: 107.0MB). Free memory was 96.1MB in the beginning and 200.3MB in the end (delta: -104.2MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2024-11-10 03:05:03,726 INFO L158 Benchmark]: IcfgBuilder took 2808.88ms. Allocated memory was 274.7MB in the beginning and 455.1MB in the end (delta: 180.4MB). Free memory was 200.3MB in the beginning and 300.9MB in the end (delta: -100.7MB). Peak memory consumption was 87.5MB. Max. memory is 16.1GB. [2024-11-10 03:05:03,726 INFO L158 Benchmark]: TraceAbstraction took 7011.22ms. Allocated memory was 455.1MB in the beginning and 559.9MB in the end (delta: 104.9MB). Free memory was 300.9MB in the beginning and 274.3MB in the end (delta: 26.6MB). Peak memory consumption was 130.5MB. Max. memory is 16.1GB. [2024-11-10 03:05:03,726 INFO L158 Benchmark]: Witness Printer took 8.82ms. Allocated memory is still 559.9MB. Free memory is still 274.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:05:03,728 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.24ms. Allocated memory is still 167.8MB. Free memory is still 134.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 758.08ms. Allocated memory is still 167.8MB. Free memory was 113.8MB in the beginning and 66.3MB in the end (delta: 47.5MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 394.53ms. Allocated memory is still 167.8MB. Free memory was 66.3MB in the beginning and 96.1MB in the end (delta: -29.8MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 398.99ms. Allocated memory was 167.8MB in the beginning and 274.7MB in the end (delta: 107.0MB). Free memory was 96.1MB in the beginning and 200.3MB in the end (delta: -104.2MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. * IcfgBuilder took 2808.88ms. Allocated memory was 274.7MB in the beginning and 455.1MB in the end (delta: 180.4MB). Free memory was 200.3MB in the beginning and 300.9MB in the end (delta: -100.7MB). Peak memory consumption was 87.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7011.22ms. Allocated memory was 455.1MB in the beginning and 559.9MB in the end (delta: 104.9MB). Free memory was 300.9MB in the beginning and 274.3MB in the end (delta: 26.6MB). Peak memory consumption was 130.5MB. Max. memory is 16.1GB. * Witness Printer took 8.82ms. Allocated memory is still 559.9MB. Free memory is still 274.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 175, overapproximation of bitwiseAnd at line 180. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 3); [L36] const SORT_7 msb_SORT_7 = (SORT_7)1 << (3 - 1); [L38] const SORT_20 mask_SORT_20 = (SORT_20)-1 >> (sizeof(SORT_20) * 8 - 2); [L39] const SORT_20 msb_SORT_20 = (SORT_20)1 << (2 - 1); [L41] const SORT_85 mask_SORT_85 = (SORT_85)-1 >> (sizeof(SORT_85) * 8 - 4); [L42] const SORT_85 msb_SORT_85 = (SORT_85)1 << (4 - 1); [L44] const SORT_150 mask_SORT_150 = (SORT_150)-1 >> (sizeof(SORT_150) * 8 - 32); [L45] const SORT_150 msb_SORT_150 = (SORT_150)1 << (32 - 1); [L47] const SORT_7 var_8 = 0; [L48] const SORT_7 var_11 = 4; [L49] const SORT_5 var_13 = 0; [L50] const SORT_7 var_17 = 2; [L51] const SORT_20 var_22 = 0; [L52] const SORT_3 var_26 = 0; [L53] const SORT_1 var_35 = 1; [L54] const SORT_1 var_43 = 0; [L55] const SORT_7 var_60 = 1; [L56] const SORT_7 var_66 = 5; [L57] const SORT_7 var_70 = 3; [L58] const SORT_7 var_102 = 7; [L59] const SORT_7 var_107 = 6; [L60] const SORT_150 var_152 = 0; [L61] const SORT_3 var_167 = 2; [L62] const SORT_3 var_184 = 31; [L64] SORT_1 input_2; [L65] SORT_3 input_4; [L66] SORT_5 input_6; [L67] SORT_3 input_173; [L68] SORT_3 input_174; [L69] SORT_3 input_175; [L70] SORT_3 input_183; [L71] SORT_3 input_193; [L72] SORT_3 input_194; [L73] SORT_3 input_195; [L74] SORT_3 input_198; [L75] SORT_3 input_217; [L76] SORT_3 input_218; [L77] SORT_3 input_219; [L78] SORT_3 input_222; [L79] SORT_3 input_224; [L80] SORT_20 input_238; [L81] SORT_20 input_239; [L82] SORT_20 input_240; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L84] SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L85] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L85] SORT_5 state_14 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L86] SORT_3 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L87] SORT_3 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L88] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L89] SORT_3 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L90] SORT_1 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L91] SORT_3 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L92] SORT_3 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L93] SORT_3 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L94] SORT_3 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L95] SORT_3 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L96] SORT_3 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L98] SORT_7 init_10_arg_1 = var_8; [L99] state_9 = init_10_arg_1 [L100] SORT_5 init_15_arg_1 = var_13; [L101] state_14 = init_15_arg_1 [L102] SORT_3 init_28_arg_1 = var_26; [L103] state_27 = init_28_arg_1 [L104] SORT_3 init_30_arg_1 = var_26; [L105] state_29 = init_30_arg_1 [L106] SORT_3 init_40_arg_1 = var_26; [L107] state_39 = init_40_arg_1 [L108] SORT_3 init_42_arg_1 = var_26; [L109] state_41 = init_42_arg_1 [L110] SORT_1 init_45_arg_1 = var_43; [L111] state_44 = init_45_arg_1 [L112] SORT_3 init_47_arg_1 = var_26; [L113] state_46 = init_47_arg_1 [L114] SORT_3 init_49_arg_1 = var_26; [L115] state_48 = init_49_arg_1 [L116] SORT_3 init_51_arg_1 = var_26; [L117] state_50 = init_51_arg_1 [L118] SORT_3 init_53_arg_1 = var_26; [L119] state_52 = init_53_arg_1 [L120] SORT_3 init_55_arg_1 = var_26; [L121] state_54 = init_55_arg_1 [L122] SORT_3 init_57_arg_1 = var_26; [L123] state_56 = init_57_arg_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L126] input_2 = __VERIFIER_nondet_uchar() [L127] input_4 = __VERIFIER_nondet_uchar() [L128] input_6 = __VERIFIER_nondet_ushort() [L129] input_173 = __VERIFIER_nondet_uchar() [L130] input_174 = __VERIFIER_nondet_uchar() [L131] input_175 = __VERIFIER_nondet_uchar() [L132] input_183 = __VERIFIER_nondet_uchar() [L133] input_193 = __VERIFIER_nondet_uchar() [L134] input_194 = __VERIFIER_nondet_uchar() [L135] input_195 = __VERIFIER_nondet_uchar() [L136] input_198 = __VERIFIER_nondet_uchar() [L137] input_217 = __VERIFIER_nondet_uchar() [L138] input_218 = __VERIFIER_nondet_uchar() [L139] input_219 = __VERIFIER_nondet_uchar() [L140] input_222 = __VERIFIER_nondet_uchar() [L141] input_224 = __VERIFIER_nondet_uchar() [L142] input_238 = __VERIFIER_nondet_uchar() [L143] input_239 = __VERIFIER_nondet_uchar() [L144] input_240 = __VERIFIER_nondet_uchar() [L147] SORT_7 var_12_arg_0 = state_9; [L148] SORT_7 var_12_arg_1 = var_11; [L149] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L150] SORT_5 var_16_arg_0 = state_14; [L151] SORT_7 var_16 = var_16_arg_0 >> 9; VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_12=0, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L152] EXPR var_16 & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_12=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L152] var_16 = var_16 & mask_SORT_7 [L153] SORT_7 var_18_arg_0 = var_16; [L154] SORT_7 var_18_arg_1 = var_17; [L155] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L156] SORT_1 var_19_arg_0 = var_12; [L157] SORT_1 var_19_arg_1 = var_18; VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_19_arg_0=0, var_19_arg_1=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L158] EXPR var_19_arg_0 & var_19_arg_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L158] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L159] SORT_5 var_21_arg_0 = state_14; [L160] SORT_20 var_21 = var_21_arg_0 >> 7; VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_19=0, var_21=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L161] EXPR var_21 & mask_SORT_20 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_19=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L161] var_21 = var_21 & mask_SORT_20 [L162] SORT_20 var_23_arg_0 = var_21; [L163] SORT_20 var_23_arg_1 = var_22; [L164] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L165] SORT_1 var_24_arg_0 = var_19; [L166] SORT_1 var_24_arg_1 = var_23; VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_24_arg_0=0, var_24_arg_1=1, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L167] EXPR var_24_arg_0 & var_24_arg_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L167] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L168] SORT_1 var_25_arg_0 = var_24; [L169] SORT_1 var_25 = ~var_25_arg_0; [L170] SORT_3 var_31_arg_0 = state_27; [L171] SORT_3 var_31_arg_1 = state_29; [L172] SORT_1 var_31 = var_31_arg_0 == var_31_arg_1; [L173] SORT_1 var_32_arg_0 = var_25; [L174] SORT_1 var_32_arg_1 = var_31; VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_32_arg_0=-1, var_32_arg_1=1, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L175] EXPR var_32_arg_0 | var_32_arg_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L175] SORT_1 var_32 = var_32_arg_0 | var_32_arg_1; [L176] SORT_1 var_36_arg_0 = var_32; [L177] SORT_1 var_36 = ~var_36_arg_0; [L178] SORT_1 var_37_arg_0 = var_35; [L179] SORT_1 var_37_arg_1 = var_36; VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_35=1, var_37_arg_0=1, var_37_arg_1=-1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L180] EXPR var_37_arg_0 & var_37_arg_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L180] SORT_1 var_37 = var_37_arg_0 & var_37_arg_1; [L181] EXPR var_37 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L181] var_37 = var_37 & mask_SORT_1 [L182] SORT_1 bad_38_arg_0 = var_37; [L183] CALL __VERIFIER_assert(!(bad_38_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 546 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2345 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2345 mSDsluCounter, 19273 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13940 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4157 IncrementalHoareTripleChecker+Invalid, 4158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 5333 mSDtfsCounter, 4157 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=562occurred in iteration=7, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 441 NumberOfCodeBlocks, 441 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 382 ConstructedInterpolants, 0 QuantifiedInterpolants, 867 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 03:05:03,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.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 52bb3902ccaac92ca995ec60bcedc54784c82a6cab90a6a11e201a4e0de664cb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:05:06,148 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:05:06,237 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-10 03:05:06,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:05:06,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:05:06,283 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:05:06,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:05:06,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:05:06,286 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:05:06,287 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:05:06,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:05:06,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:05:06,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:05:06,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:05:06,290 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:05:06,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:05:06,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:05:06,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:05:06,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:05:06,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:05:06,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:05:06,296 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:05:06,296 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:05:06,297 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:05:06,297 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:05:06,297 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:05:06,297 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:05:06,305 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:05:06,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:05:06,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:05:06,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:05:06,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:05:06,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:05:06,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:05:06,307 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:05:06,308 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:05:06,308 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:05:06,308 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:05:06,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:05:06,309 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:05:06,309 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:05:06,309 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52bb3902ccaac92ca995ec60bcedc54784c82a6cab90a6a11e201a4e0de664cb [2024-11-10 03:05:06,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:05:06,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:05:06,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:05:06,730 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:05:06,730 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:05:06,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c [2024-11-10 03:05:08,444 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:05:08,700 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:05:08,701 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c [2024-11-10 03:05:08,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/864d4ea31/785e1fefb6534d1c90e25d46321d775b/FLAG5e592bb0f [2024-11-10 03:05:09,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/864d4ea31/785e1fefb6534d1c90e25d46321d775b [2024-11-10 03:05:09,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:05:09,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:05:09,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:05:09,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:05:09,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:05:09,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:05:09" (1/1) ... [2024-11-10 03:05:09,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bea4c4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:09, skipping insertion in model container [2024-11-10 03:05:09,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:05:09" (1/1) ... [2024-11-10 03:05:09,091 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:05:09,329 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c[1259,1272] [2024-11-10 03:05:09,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:05:09,634 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:05:09,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c[1259,1272] [2024-11-10 03:05:09,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:05:09,779 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:05:09,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:09 WrapperNode [2024-11-10 03:05:09,780 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:05:09,781 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:05:09,781 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:05:09,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:05:09,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:09" (1/1) ... [2024-11-10 03:05:09,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:09" (1/1) ... [2024-11-10 03:05:09,902 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1082 [2024-11-10 03:05:09,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:05:09,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:05:09,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:05:09,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:05:09,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:09" (1/1) ... [2024-11-10 03:05:09,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:09" (1/1) ... [2024-11-10 03:05:09,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:09" (1/1) ... [2024-11-10 03:05:09,958 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:05:09,958 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:09" (1/1) ... [2024-11-10 03:05:09,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:09" (1/1) ... [2024-11-10 03:05:09,985 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:09" (1/1) ... [2024-11-10 03:05:09,987 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:09" (1/1) ... [2024-11-10 03:05:09,992 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:09" (1/1) ... [2024-11-10 03:05:09,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:09" (1/1) ... [2024-11-10 03:05:10,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:05:10,014 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:05:10,014 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:05:10,015 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:05:10,015 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:09" (1/1) ... [2024-11-10 03:05:10,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:05:10,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:05:10,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:05:10,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:05:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:05:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:05:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:05:10,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:05:10,336 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:05:10,338 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:05:11,756 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-11-10 03:05:11,757 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:05:11,768 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:05:11,769 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:05:11,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:05:11 BoogieIcfgContainer [2024-11-10 03:05:11,770 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:05:11,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:05:11,773 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:05:11,776 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:05:11,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:05:09" (1/3) ... [2024-11-10 03:05:11,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f6fb9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:05:11, skipping insertion in model container [2024-11-10 03:05:11,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:05:09" (2/3) ... [2024-11-10 03:05:11,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f6fb9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:05:11, skipping insertion in model container [2024-11-10 03:05:11,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:05:11" (3/3) ... [2024-11-10 03:05:11,781 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p15.c [2024-11-10 03:05:11,798 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:05:11,799 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:05:11,853 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:05:11,861 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;@678c9c4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:05:11,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:05:11,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:11,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 03:05:11,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:05:11,874 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 03:05:11,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:05:11,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:05:11,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-10 03:05:11,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:05:11,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087542766] [2024-11-10 03:05:11,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:05:11,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:05:11,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:05:11,903 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:05:11,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 03:05:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:05:12,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 03:05:12,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:05:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:05:12,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:05:12,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:05:12,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087542766] [2024-11-10 03:05:12,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087542766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:05:12,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:05:12,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:05:12,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789540880] [2024-11-10 03:05:12,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:05:12,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:05:12,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:05:12,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:05:12,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:05:12,399 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:12,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:05:12,515 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-10 03:05:12,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:05:12,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 03:05:12,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:05:12,526 INFO L225 Difference]: With dead ends: 22 [2024-11-10 03:05:12,527 INFO L226 Difference]: Without dead ends: 11 [2024-11-10 03:05:12,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:05:12,535 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:05:12,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:05:12,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-10 03:05:12,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-10 03:05:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:12,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-10 03:05:12,571 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-10 03:05:12,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:05:12,572 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-10 03:05:12,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-10 03:05:12,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 03:05:12,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:05:12,574 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:05:12,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 03:05:12,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:05:12,775 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:05:12,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:05:12,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-10 03:05:12,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:05:12,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763661758] [2024-11-10 03:05:12,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:05:12,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:05:12,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:05:12,782 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:05:12,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 03:05:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:05:13,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-10 03:05:13,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:05:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:05:13,597 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:05:13,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:05:13,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:05:13,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763661758] [2024-11-10 03:05:13,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763661758] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:05:13,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 03:05:13,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 03:05:13,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505254882] [2024-11-10 03:05:13,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 03:05:13,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 03:05:13,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:05:13,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 03:05:13,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:05:13,904 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:14,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:05:14,732 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2024-11-10 03:05:14,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 03:05:14,732 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-10 03:05:14,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:05:14,733 INFO L225 Difference]: With dead ends: 20 [2024-11-10 03:05:14,733 INFO L226 Difference]: Without dead ends: 17 [2024-11-10 03:05:14,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-10 03:05:14,736 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 03:05:14,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 03:05:14,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-10 03:05:14,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-11-10 03:05:14,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:14,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2024-11-10 03:05:14,748 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2024-11-10 03:05:14,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:05:14,748 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2024-11-10 03:05:14,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:14,748 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2024-11-10 03:05:14,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 03:05:14,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:05:14,749 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2024-11-10 03:05:14,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 03:05:14,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:05:14,950 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:05:14,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:05:14,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1989777505, now seen corresponding path program 2 times [2024-11-10 03:05:14,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:05:14,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075829714] [2024-11-10 03:05:14,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 03:05:14,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:05:14,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:05:14,958 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:05:14,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 03:05:15,980 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 03:05:15,980 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 03:05:16,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 03:05:16,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:05:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:05:16,508 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:05:17,753 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:05:17,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:05:17,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075829714] [2024-11-10 03:05:17,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075829714] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:05:17,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 03:05:17,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-10 03:05:17,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235441115] [2024-11-10 03:05:17,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 03:05:17,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 03:05:17,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:05:17,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 03:05:17,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-10 03:05:17,757 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:18,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:05:18,885 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2024-11-10 03:05:18,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 03:05:18,885 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-10 03:05:18,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:05:18,887 INFO L225 Difference]: With dead ends: 35 [2024-11-10 03:05:18,887 INFO L226 Difference]: Without dead ends: 32 [2024-11-10 03:05:18,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-10 03:05:18,888 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 03:05:18,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 29 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 03:05:18,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-10 03:05:18,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-11-10 03:05:18,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2024-11-10 03:05:18,897 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 15 [2024-11-10 03:05:18,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:05:18,897 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2024-11-10 03:05:18,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:05:18,898 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2024-11-10 03:05:18,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 03:05:18,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:05:18,898 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2024-11-10 03:05:18,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 03:05:19,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:05:19,099 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:05:19,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:05:19,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1651905795, now seen corresponding path program 3 times [2024-11-10 03:05:19,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:05:19,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736182510] [2024-11-10 03:05:19,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 03:05:19,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:05:19,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:05:19,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:05:19,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 03:05:20,293 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-10 03:05:20,293 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 03:05:20,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-10 03:05:20,344 INFO L278 TraceCheckSpWp]: Computing forward predicates...