./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.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.dyn_partition.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 807a67cda124a3fcd6cb05c7902844a26646fa59fdd69e67d53bd60fc10f4ac4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:59:54,581 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:59:54,669 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 01:59:54,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:59:54,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:59:54,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:59:54,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:59:54,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:59:54,710 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:59:54,711 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:59:54,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:59:54,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:59:54,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:59:54,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:59:54,715 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:59:54,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:59:54,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:59:54,716 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 01:59:54,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:59:54,716 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:59:54,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:59:54,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:59:54,721 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:59:54,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:59:54,721 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:59:54,721 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:59:54,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:59:54,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:59:54,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:59:54,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:59:54,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:59:54,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:59:54,723 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:59:54,723 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 01:59:54,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 01:59:54,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:59:54,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:59:54,726 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:59:54,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:59:54,727 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 -> 807a67cda124a3fcd6cb05c7902844a26646fa59fdd69e67d53bd60fc10f4ac4 [2024-11-10 01:59:55,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:59:55,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:59:55,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:59:55,031 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:59:55,032 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:59:55,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-11-10 01:59:56,466 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:59:56,661 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:59:56,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-11-10 01:59:56,669 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87d102c03/89bdfdaa11d547349d6877045697a92f/FLAG816ee387a [2024-11-10 01:59:56,680 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87d102c03/89bdfdaa11d547349d6877045697a92f [2024-11-10 01:59:56,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:59:56,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:59:56,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:59:56,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:59:56,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:59:56,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:59:56" (1/1) ... [2024-11-10 01:59:56,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa3986f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:59:56, skipping insertion in model container [2024-11-10 01:59:56,691 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:59:56" (1/1) ... [2024-11-10 01:59:56,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:59:56,895 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.dyn_partition.c[1253,1266] [2024-11-10 01:59:56,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:59:56,969 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:59:56,983 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.dyn_partition.c[1253,1266] [2024-11-10 01:59:57,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:59:57,039 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:59:57,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:59:57 WrapperNode [2024-11-10 01:59:57,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:59:57,041 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:59:57,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:59:57,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:59:57,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:59:57" (1/1) ... [2024-11-10 01:59:57,064 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:59:57" (1/1) ... [2024-11-10 01:59:57,118 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 195 [2024-11-10 01:59:57,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:59:57,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:59:57,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:59:57,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:59:57,130 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:59:57" (1/1) ... [2024-11-10 01:59:57,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:59:57" (1/1) ... [2024-11-10 01:59:57,138 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:59:57" (1/1) ... [2024-11-10 01:59:57,158 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 01:59:57,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:59:57" (1/1) ... [2024-11-10 01:59:57,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:59:57" (1/1) ... [2024-11-10 01:59:57,171 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:59:57" (1/1) ... [2024-11-10 01:59:57,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:59:57" (1/1) ... [2024-11-10 01:59:57,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:59:57" (1/1) ... [2024-11-10 01:59:57,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:59:57" (1/1) ... [2024-11-10 01:59:57,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:59:57,188 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:59:57,189 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:59:57,189 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:59:57,190 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:59:57" (1/1) ... [2024-11-10 01:59:57,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:59:57,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:59:57,227 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 01:59:57,230 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 01:59:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:59:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 01:59:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:59:57,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:59:57,379 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:59:57,383 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:59:57,823 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2024-11-10 01:59:57,824 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:59:57,865 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:59:57,866 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:59:57,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:59:57 BoogieIcfgContainer [2024-11-10 01:59:57,867 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:59:57,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:59:57,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:59:57,874 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:59:57,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:59:56" (1/3) ... [2024-11-10 01:59:57,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4628f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:59:57, skipping insertion in model container [2024-11-10 01:59:57,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:59:57" (2/3) ... [2024-11-10 01:59:57,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4628f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:59:57, skipping insertion in model container [2024-11-10 01:59:57,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:59:57" (3/3) ... [2024-11-10 01:59:57,879 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.dyn_partition.c [2024-11-10 01:59:57,897 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:59:57,897 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 01:59:57,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:59:57,970 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;@5f5aaa2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:59:57,970 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 01:59:57,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 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 01:59:57,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 01:59:57,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:59:57,984 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:59:57,985 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:59:57,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:59:57,991 INFO L85 PathProgramCache]: Analyzing trace with hash 712089965, now seen corresponding path program 1 times [2024-11-10 01:59:58,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:59:58,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395068344] [2024-11-10 01:59:58,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:59:58,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:59:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:59:58,532 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 01:59:58,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:59:58,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395068344] [2024-11-10 01:59:58,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395068344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:59:58,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:59:58,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:59:58,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059874698] [2024-11-10 01:59:58,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:59:58,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:59:58,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:59:58,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:59:58,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:59:58,577 INFO L87 Difference]: Start difference. First operand has 57 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 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 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 01:59:58,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:59:58,659 INFO L93 Difference]: Finished difference Result 93 states and 133 transitions. [2024-11-10 01:59:58,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:59:58,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-11-10 01:59:58,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:59:58,669 INFO L225 Difference]: With dead ends: 93 [2024-11-10 01:59:58,670 INFO L226 Difference]: Without dead ends: 54 [2024-11-10 01:59:58,673 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 01:59:58,677 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:59:58,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:59:58,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-10 01:59:58,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-10 01:59:58,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 53 states have internal predecessors, (76), 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 01:59:58,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 76 transitions. [2024-11-10 01:59:58,711 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 76 transitions. Word has length 18 [2024-11-10 01:59:58,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:59:58,712 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 76 transitions. [2024-11-10 01:59:58,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 01:59:58,712 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 76 transitions. [2024-11-10 01:59:58,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 01:59:58,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:59:58,713 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:59:58,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 01:59:58,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:59:58,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:59:58,714 INFO L85 PathProgramCache]: Analyzing trace with hash 745005847, now seen corresponding path program 1 times [2024-11-10 01:59:58,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:59:58,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382382775] [2024-11-10 01:59:58,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:59:58,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:59:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:59:58,827 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 01:59:58,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:59:58,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382382775] [2024-11-10 01:59:58,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382382775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:59:58,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:59:58,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:59:58,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971394649] [2024-11-10 01:59:58,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:59:58,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:59:58,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:59:58,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:59:58,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:59:58,835 INFO L87 Difference]: Start difference. First operand 54 states and 76 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 01:59:58,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:59:58,899 INFO L93 Difference]: Finished difference Result 92 states and 129 transitions. [2024-11-10 01:59:58,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:59:58,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2024-11-10 01:59:58,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:59:58,900 INFO L225 Difference]: With dead ends: 92 [2024-11-10 01:59:58,901 INFO L226 Difference]: Without dead ends: 56 [2024-11-10 01:59:58,901 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 01:59:58,903 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:59:58,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:59:58,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-10 01:59:58,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-10 01:59:58,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 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 01:59:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2024-11-10 01:59:58,915 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 19 [2024-11-10 01:59:58,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:59:58,916 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2024-11-10 01:59:58,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 01:59:58,917 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2024-11-10 01:59:58,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 01:59:58,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:59:58,919 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] [2024-11-10 01:59:58,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 01:59:58,919 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:59:58,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:59:58,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1367588370, now seen corresponding path program 1 times [2024-11-10 01:59:58,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:59:58,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123697978] [2024-11-10 01:59:58,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:59:58,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:59:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:59:59,157 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 01:59:59,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:59:59,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123697978] [2024-11-10 01:59:59,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123697978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:59:59,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:59:59,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:59:59,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957050203] [2024-11-10 01:59:59,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:59:59,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:59:59,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:59:59,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:59:59,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:59:59,163 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 01:59:59,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:59:59,236 INFO L93 Difference]: Finished difference Result 92 states and 128 transitions. [2024-11-10 01:59:59,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:59:59,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2024-11-10 01:59:59,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:59:59,238 INFO L225 Difference]: With dead ends: 92 [2024-11-10 01:59:59,238 INFO L226 Difference]: Without dead ends: 54 [2024-11-10 01:59:59,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:59:59,240 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 64 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:59:59,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 171 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:59:59,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-10 01:59:59,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-10 01:59:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 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 01:59:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2024-11-10 01:59:59,249 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 20 [2024-11-10 01:59:59,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:59:59,250 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2024-11-10 01:59:59,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 01:59:59,250 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2024-11-10 01:59:59,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 01:59:59,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:59:59,255 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] [2024-11-10 01:59:59,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 01:59:59,255 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:59:59,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:59:59,256 INFO L85 PathProgramCache]: Analyzing trace with hash -494311603, now seen corresponding path program 1 times [2024-11-10 01:59:59,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:59:59,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213208827] [2024-11-10 01:59:59,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:59:59,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:59:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 01:59:59,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 01:59:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 01:59:59,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 01:59:59,396 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 01:59:59,398 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 01:59:59,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 01:59:59,410 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 01:59:59,472 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 01:59:59,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:59:59 BoogieIcfgContainer [2024-11-10 01:59:59,475 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 01:59:59,476 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 01:59:59,476 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 01:59:59,477 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 01:59:59,478 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:59:57" (3/4) ... [2024-11-10 01:59:59,481 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 01:59:59,482 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 01:59:59,483 INFO L158 Benchmark]: Toolchain (without parser) took 2798.95ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 101.9MB in the beginning and 190.8MB in the end (delta: -88.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 01:59:59,483 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 159.4MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 01:59:59,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.91ms. Allocated memory is still 159.4MB. Free memory was 101.5MB in the beginning and 86.7MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 01:59:59,484 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.73ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 81.5MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 01:59:59,486 INFO L158 Benchmark]: Boogie Preprocessor took 67.84ms. Allocated memory is still 159.4MB. Free memory was 81.5MB in the beginning and 78.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 01:59:59,486 INFO L158 Benchmark]: IcfgBuilder took 678.45ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 78.4MB in the beginning and 178.9MB in the end (delta: -100.5MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2024-11-10 01:59:59,486 INFO L158 Benchmark]: TraceAbstraction took 1605.51ms. Allocated memory is still 226.5MB. Free memory was 177.9MB in the beginning and 190.8MB in the end (delta: -12.9MB). Peak memory consumption was 116.1MB. Max. memory is 16.1GB. [2024-11-10 01:59:59,487 INFO L158 Benchmark]: Witness Printer took 6.09ms. Allocated memory is still 226.5MB. Free memory is still 190.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 01:59:59,488 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.21ms. Allocated memory is still 159.4MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.91ms. Allocated memory is still 159.4MB. Free memory was 101.5MB in the beginning and 86.7MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.73ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 81.5MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.84ms. Allocated memory is still 159.4MB. Free memory was 81.5MB in the beginning and 78.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 678.45ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 78.4MB in the beginning and 178.9MB in the end (delta: -100.5MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1605.51ms. Allocated memory is still 226.5MB. Free memory was 177.9MB in the beginning and 190.8MB in the end (delta: -12.9MB). Peak memory consumption was 116.1MB. Max. memory is 16.1GB. * Witness Printer took 6.09ms. Allocated memory is still 226.5MB. Free memory is still 190.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 69. 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_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 3); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (3 - 1); [L32] const SORT_23 mask_SORT_23 = (SORT_23)-1 >> (sizeof(SORT_23) * 8 - 32); [L33] const SORT_23 msb_SORT_23 = (SORT_23)1 << (32 - 1); [L35] const SORT_4 var_5 = 0; [L36] const SORT_1 var_13 = 1; [L37] const SORT_1 var_17 = 0; [L38] const SORT_23 var_25 = 1; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L43] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=7, var_13=1, var_17=0, var_25=1, var_5=0] [L43] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L44] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=7, var_13=1, var_17=0, var_25=1, var_5=0] [L44] SORT_4 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, var_13=1, var_17=0, var_25=1, var_5=0] [L45] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, var_13=1, var_17=0, var_25=1, var_5=0] [L46] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_4 init_7_arg_1 = var_5; [L49] state_6 = init_7_arg_1 [L50] SORT_4 init_9_arg_1 = var_5; [L51] state_8 = init_9_arg_1 [L52] SORT_1 init_19_arg_1 = var_17; [L53] state_18 = init_19_arg_1 [L54] SORT_1 init_21_arg_1 = var_17; [L55] state_20 = init_21_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 64 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 64 mSDsluCounter, 524 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 344 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 129 IncrementalHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 180 mSDtfsCounter, 129 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 103 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 01:59:59,520 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.dyn_partition.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 807a67cda124a3fcd6cb05c7902844a26646fa59fdd69e67d53bd60fc10f4ac4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 02:00:01,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 02:00:01,850 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-10 02:00:01,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 02:00:01,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 02:00:01,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 02:00:01,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 02:00:01,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 02:00:01,887 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 02:00:01,889 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 02:00:01,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 02:00:01,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 02:00:01,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 02:00:01,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 02:00:01,894 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 02:00:01,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 02:00:01,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 02:00:01,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 02:00:01,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 02:00:01,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 02:00:01,896 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 02:00:01,896 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 02:00:01,896 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 02:00:01,896 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 02:00:01,897 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 02:00:01,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 02:00:01,897 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 02:00:01,897 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 02:00:01,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 02:00:01,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 02:00:01,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 02:00:01,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:00:01,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 02:00:01,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 02:00:01,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 02:00:01,911 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 02:00:01,911 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 02:00:01,912 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 02:00:01,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 02:00:01,912 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 02:00:01,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 02:00:01,912 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 -> 807a67cda124a3fcd6cb05c7902844a26646fa59fdd69e67d53bd60fc10f4ac4 [2024-11-10 02:00:02,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 02:00:02,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 02:00:02,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 02:00:02,282 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 02:00:02,282 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 02:00:02,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-11-10 02:00:03,907 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 02:00:04,117 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 02:00:04,118 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-11-10 02:00:04,130 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bae18fa7/66d2ddc609694143930d0a247e1dba62/FLAG184d8eed8 [2024-11-10 02:00:04,149 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bae18fa7/66d2ddc609694143930d0a247e1dba62 [2024-11-10 02:00:04,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 02:00:04,155 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 02:00:04,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 02:00:04,158 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 02:00:04,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 02:00:04,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:00:04" (1/1) ... [2024-11-10 02:00:04,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4892fb2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:00:04, skipping insertion in model container [2024-11-10 02:00:04,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:00:04" (1/1) ... [2024-11-10 02:00:04,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 02:00:04,389 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.dyn_partition.c[1253,1266] [2024-11-10 02:00:04,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:00:04,460 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 02:00:04,474 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.dyn_partition.c[1253,1266] [2024-11-10 02:00:04,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:00:04,528 INFO L204 MainTranslator]: Completed translation [2024-11-10 02:00:04,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:00:04 WrapperNode [2024-11-10 02:00:04,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 02:00:04,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 02:00:04,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 02:00:04,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 02:00:04,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:00:04" (1/1) ... [2024-11-10 02:00:04,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:00:04" (1/1) ... [2024-11-10 02:00:04,573 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 107 [2024-11-10 02:00:04,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 02:00:04,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 02:00:04,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 02:00:04,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 02:00:04,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:00:04" (1/1) ... [2024-11-10 02:00:04,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:00:04" (1/1) ... [2024-11-10 02:00:04,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:00:04" (1/1) ... [2024-11-10 02:00:04,622 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 02:00:04,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:00:04" (1/1) ... [2024-11-10 02:00:04,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:00:04" (1/1) ... [2024-11-10 02:00:04,632 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:00:04" (1/1) ... [2024-11-10 02:00:04,632 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:00:04" (1/1) ... [2024-11-10 02:00:04,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:00:04" (1/1) ... [2024-11-10 02:00:04,635 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:00:04" (1/1) ... [2024-11-10 02:00:04,637 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 02:00:04,638 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 02:00:04,639 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 02:00:04,639 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 02:00:04,640 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:00:04" (1/1) ... [2024-11-10 02:00:04,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:00:04,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:00:04,674 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 02:00:04,677 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 02:00:04,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 02:00:04,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 02:00:04,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 02:00:04,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 02:00:04,800 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 02:00:04,802 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 02:00:05,037 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-10 02:00:05,041 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 02:00:05,057 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 02:00:05,058 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 02:00:05,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:00:05 BoogieIcfgContainer [2024-11-10 02:00:05,058 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 02:00:05,077 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 02:00:05,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 02:00:05,081 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 02:00:05,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:00:04" (1/3) ... [2024-11-10 02:00:05,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2016702d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:00:05, skipping insertion in model container [2024-11-10 02:00:05,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:00:04" (2/3) ... [2024-11-10 02:00:05,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2016702d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:00:05, skipping insertion in model container [2024-11-10 02:00:05,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:00:05" (3/3) ... [2024-11-10 02:00:05,084 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.dyn_partition.c [2024-11-10 02:00:05,104 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 02:00:05,105 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 02:00:05,164 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 02:00:05,170 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;@78d11cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 02:00:05,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 02:00:05,173 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 02:00:05,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 02:00:05,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:00:05,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 02:00:05,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:00:05,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:00:05,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-10 02:00:05,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:00:05,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097373140] [2024-11-10 02:00:05,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:00:05,196 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 02:00:05,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:00:05,199 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 02:00:05,201 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 02:00:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:00:05,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 02:00:05,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:00:05,586 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 02:00:05,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 02:00:05,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 02:00:05,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097373140] [2024-11-10 02:00:05,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097373140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:00:05,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:00:05,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:00:05,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591518877] [2024-11-10 02:00:05,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:00:05,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:00:05,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 02:00:05,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:00:05,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:00:05,627 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 02:00:05,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:00:05,677 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-10 02:00:05,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:00:05,680 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 02:00:05,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:00:05,686 INFO L225 Difference]: With dead ends: 22 [2024-11-10 02:00:05,687 INFO L226 Difference]: Without dead ends: 11 [2024-11-10 02:00:05,689 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 02:00:05,694 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-11-10 02:00:05,697 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.0s Time] [2024-11-10 02:00:05,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-10 02:00:05,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-10 02:00:05,733 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 02:00:05,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-10 02:00:05,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-10 02:00:05,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:00:05,735 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-10 02:00:05,736 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 02:00:05,736 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-10 02:00:05,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 02:00:05,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:00:05,737 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:00:05,742 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 02:00:05,940 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 02:00:05,941 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:00:05,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:00:05,942 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-10 02:00:05,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:00:05,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638120441] [2024-11-10 02:00:05,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:00:05,943 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 02:00:05,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:00:05,946 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 02:00:05,947 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 02:00:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:00:06,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 02:00:06,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:00:06,207 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 02:00:06,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:00:06,710 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 02:00:06,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 02:00:06,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638120441] [2024-11-10 02:00:06,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1638120441] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 02:00:06,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 02:00:06,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 02:00:06,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236581441] [2024-11-10 02:00:06,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 02:00:06,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 02:00:06,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 02:00:06,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 02:00:06,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:00:06,715 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 02:00:06,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:00:06,781 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-11-10 02:00:06,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 02:00:06,782 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 02:00:06,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:00:06,782 INFO L225 Difference]: With dead ends: 17 [2024-11-10 02:00:06,782 INFO L226 Difference]: Without dead ends: 14 [2024-11-10 02:00:06,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-10 02:00:06,784 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 02:00:06,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 18 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 02:00:06,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-10 02:00:06,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-11-10 02:00:06,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:00:06,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-10 02:00:06,792 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2024-11-10 02:00:06,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:00:06,792 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-10 02:00:06,792 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 02:00:06,793 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-10 02:00:06,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 02:00:06,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:00:06,793 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2024-11-10 02:00:06,797 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 02:00:06,993 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 02:00:06,994 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:00:06,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:00:06,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1723041149, now seen corresponding path program 2 times [2024-11-10 02:00:06,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:00:06,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360043485] [2024-11-10 02:00:06,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 02:00:06,996 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 02:00:06,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:00:06,998 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 02:00:06,999 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 02:00:07,081 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 02:00:07,081 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 02:00:07,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 02:00:07,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:00:07,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:00:07,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:00:08,448 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:00:08,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 02:00:08,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360043485] [2024-11-10 02:00:08,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [360043485] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 02:00:08,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 02:00:08,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-10 02:00:08,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92820287] [2024-11-10 02:00:08,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 02:00:08,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 02:00:08,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 02:00:08,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 02:00:08,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-10 02:00:08,452 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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 02:00:09,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:00:09,069 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-11-10 02:00:09,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 02:00:09,070 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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 12 [2024-11-10 02:00:09,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:00:09,071 INFO L225 Difference]: With dead ends: 26 [2024-11-10 02:00:09,071 INFO L226 Difference]: Without dead ends: 23 [2024-11-10 02:00:09,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2024-11-10 02:00:09,074 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:00:09,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:00:09,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-10 02:00:09,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-11-10 02:00:09,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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 02:00:09,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2024-11-10 02:00:09,083 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 12 [2024-11-10 02:00:09,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:00:09,083 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2024-11-10 02:00:09,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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 02:00:09,084 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2024-11-10 02:00:09,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 02:00:09,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:00:09,085 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1] [2024-11-10 02:00:09,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 02:00:09,286 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 02:00:09,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:00:09,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:00:09,287 INFO L85 PathProgramCache]: Analyzing trace with hash -165199135, now seen corresponding path program 3 times [2024-11-10 02:00:09,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:00:09,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749038520] [2024-11-10 02:00:09,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 02:00:09,292 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 02:00:09,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:00:09,295 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 02:00:09,296 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 02:00:09,409 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-10 02:00:09,410 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 02:00:09,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-10 02:00:09,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:00:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:00:09,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:00:14,112 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:00:14,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 02:00:14,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749038520] [2024-11-10 02:00:14,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749038520] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 02:00:14,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 02:00:14,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-10 02:00:14,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412379860] [2024-11-10 02:00:14,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 02:00:14,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 02:00:14,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 02:00:14,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 02:00:14,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-10 02:00:14,126 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 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 02:00:17,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:00:17,398 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-11-10 02:00:17,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 02:00:17,398 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 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 21 [2024-11-10 02:00:17,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:00:17,399 INFO L225 Difference]: With dead ends: 44 [2024-11-10 02:00:17,399 INFO L226 Difference]: Without dead ends: 41 [2024-11-10 02:00:17,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=298, Invalid=694, Unknown=0, NotChecked=0, Total=992 [2024-11-10 02:00:17,400 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:00:17,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 34 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:00:17,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-10 02:00:17,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-10 02:00:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:00:17,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2024-11-10 02:00:17,417 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 21 [2024-11-10 02:00:17,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:00:17,417 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2024-11-10 02:00:17,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 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 02:00:17,417 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2024-11-10 02:00:17,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 02:00:17,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:00:17,418 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1] [2024-11-10 02:00:17,421 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 (5)] Ended with exit code 0 [2024-11-10 02:00:17,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 02:00:17,619 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:00:17,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:00:17,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1766522271, now seen corresponding path program 4 times [2024-11-10 02:00:17,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:00:17,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245539196] [2024-11-10 02:00:17,620 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 02:00:17,621 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 02:00:17,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:00:17,624 INFO L229 MonitoredProcess]: Starting monitored process 6 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 02:00:17,625 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 (6)] Waiting until timeout for monitored process [2024-11-10 02:00:17,832 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 02:00:17,833 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 02:00:17,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-10 02:00:17,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:00:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:00:19,065 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:01:23,799 WARN L286 SmtUtils]: Spent 5.53s on a formula simplification that was a NOOP. DAG size: 189 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)