./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.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.dk.eval-mul-div-a046e57-m [2024-10-12 22:41:36,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 22:41:37,014 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-12 22:41:37,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 22:41:37,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 22:41:37,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 22:41:37,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 22:41:37,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 22:41:37,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 22:41:37,046 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 22:41:37,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 22:41:37,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 22:41:37,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 22:41:37,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 22:41:37,047 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 22:41:37,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 22:41:37,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 22:41:37,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 22:41:37,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 22:41:37,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 22:41:37,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 22:41:37,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 22:41:37,050 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 22:41:37,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 22:41:37,051 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 22:41:37,051 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 22:41:37,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 22:41:37,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 22:41:37,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 22:41:37,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:41:37,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 22:41:37,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 22:41:37,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 22:41:37,053 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 22:41:37,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 22:41:37,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 22:41:37,054 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 22:41:37,054 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 22:41:37,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 22:41:37,054 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-10-12 22:41:37,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 22:41:37,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 22:41:37,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 22:41:37,269 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 22:41:37,269 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 22:41:37,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-10-12 22:41:38,422 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 22:41:38,577 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 22:41:38,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-10-12 22:41:38,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c3f0d557/4f6559473e2e4a3f9ac09236cf064721/FLAG8dd2f65e5 [2024-10-12 22:41:38,602 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c3f0d557/4f6559473e2e4a3f9ac09236cf064721 [2024-10-12 22:41:38,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 22:41:38,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 22:41:38,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 22:41:38,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 22:41:38,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 22:41:38,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:41:38" (1/1) ... [2024-10-12 22:41:38,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6118ef57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:38, skipping insertion in model container [2024-10-12 22:41:38,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:41:38" (1/1) ... [2024-10-12 22:41:38,643 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 22:41:38,808 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1253,1266] [2024-10-12 22:41:38,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:41:38,852 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 22:41:38,861 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1253,1266] [2024-10-12 22:41:38,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:41:38,894 INFO L204 MainTranslator]: Completed translation [2024-10-12 22:41:38,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:38 WrapperNode [2024-10-12 22:41:38,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 22:41:38,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 22:41:38,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 22:41:38,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 22:41:38,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:38" (1/1) ... [2024-10-12 22:41:38,910 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:38" (1/1) ... [2024-10-12 22:41:38,940 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 196 [2024-10-12 22:41:38,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 22:41:38,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 22:41:38,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 22:41:38,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 22:41:38,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:38" (1/1) ... [2024-10-12 22:41:38,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:38" (1/1) ... [2024-10-12 22:41:38,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:38" (1/1) ... [2024-10-12 22:41:38,966 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 22:41:38,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:38" (1/1) ... [2024-10-12 22:41:38,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:38" (1/1) ... [2024-10-12 22:41:38,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:38" (1/1) ... [2024-10-12 22:41:38,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:38" (1/1) ... [2024-10-12 22:41:38,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:38" (1/1) ... [2024-10-12 22:41:38,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:38" (1/1) ... [2024-10-12 22:41:38,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 22:41:38,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 22:41:38,987 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 22:41:38,987 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 22:41:38,987 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:38" (1/1) ... [2024-10-12 22:41:38,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:41:39,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:41:39,020 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 22:41:39,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 22:41:39,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 22:41:39,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 22:41:39,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 22:41:39,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 22:41:39,129 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 22:41:39,132 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 22:41:39,430 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2024-10-12 22:41:39,431 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 22:41:39,459 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 22:41:39,459 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 22:41:39,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:41:39 BoogieIcfgContainer [2024-10-12 22:41:39,460 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 22:41:39,461 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 22:41:39,461 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 22:41:39,464 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 22:41:39,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 10:41:38" (1/3) ... [2024-10-12 22:41:39,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cd0e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:41:39, skipping insertion in model container [2024-10-12 22:41:39,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:38" (2/3) ... [2024-10-12 22:41:39,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cd0e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:41:39, skipping insertion in model container [2024-10-12 22:41:39,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:41:39" (3/3) ... [2024-10-12 22:41:39,467 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.dyn_partition.c [2024-10-12 22:41:39,479 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 22:41:39,479 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 22:41:39,517 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 22:41:39,522 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;@619a19f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 22:41:39,522 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 22:41:39,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 49 states have (on average 1.510204081632653) internal successors, (74), 50 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-10-12 22:41:39,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 22:41:39,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:41:39,532 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:41:39,532 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:41:39,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:41:39,538 INFO L85 PathProgramCache]: Analyzing trace with hash -413946111, now seen corresponding path program 1 times [2024-10-12 22:41:39,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:41:39,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848867349] [2024-10-12 22:41:39,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:41:39,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:41:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:41:39,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:41:39,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:41:39,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848867349] [2024-10-12 22:41:39,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848867349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:41:39,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:41:39,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:41:39,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531839693] [2024-10-12 22:41:39,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:41:39,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:41:39,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:41:39,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:41:39,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:41:39,954 INFO L87 Difference]: Start difference. First operand has 51 states, 49 states have (on average 1.510204081632653) internal successors, (74), 50 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) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:41:39,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:41:39,990 INFO L93 Difference]: Finished difference Result 86 states and 126 transitions. [2024-10-12 22:41:39,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:41:39,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-12 22:41:39,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:41:39,998 INFO L225 Difference]: With dead ends: 86 [2024-10-12 22:41:39,999 INFO L226 Difference]: Without dead ends: 52 [2024-10-12 22:41:40,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:41:40,005 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:41:40,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:41:40,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-12 22:41:40,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-12 22:41:40,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 51 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-10-12 22:41:40,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2024-10-12 22:41:40,036 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 16 [2024-10-12 22:41:40,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:41:40,037 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2024-10-12 22:41:40,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:41:40,037 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2024-10-12 22:41:40,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 22:41:40,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:41:40,038 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:41:40,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 22:41:40,039 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:41:40,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:41:40,039 INFO L85 PathProgramCache]: Analyzing trace with hash 54267678, now seen corresponding path program 1 times [2024-10-12 22:41:40,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:41:40,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755537719] [2024-10-12 22:41:40,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:41:40,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:41:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:41:40,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:41:40,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:41:40,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755537719] [2024-10-12 22:41:40,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755537719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:41:40,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:41:40,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:41:40,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48476034] [2024-10-12 22:41:40,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:41:40,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:41:40,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:41:40,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:41:40,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:41:40,145 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:41:40,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:41:40,170 INFO L93 Difference]: Finished difference Result 89 states and 126 transitions. [2024-10-12 22:41:40,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:41:40,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2024-10-12 22:41:40,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:41:40,172 INFO L225 Difference]: With dead ends: 89 [2024-10-12 22:41:40,172 INFO L226 Difference]: Without dead ends: 54 [2024-10-12 22:41:40,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:41:40,173 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:41:40,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:41:40,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-12 22:41:40,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-12 22:41:40,178 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-10-12 22:41:40,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 76 transitions. [2024-10-12 22:41:40,181 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 76 transitions. Word has length 17 [2024-10-12 22:41:40,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:41:40,182 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 76 transitions. [2024-10-12 22:41:40,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:41:40,182 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 76 transitions. [2024-10-12 22:41:40,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 22:41:40,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:41:40,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:41:40,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 22:41:40,183 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:41:40,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:41:40,184 INFO L85 PathProgramCache]: Analyzing trace with hash 584332154, now seen corresponding path program 1 times [2024-10-12 22:41:40,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:41:40,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940364095] [2024-10-12 22:41:40,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:41:40,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:41:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:41:40,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:41:40,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:41:40,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940364095] [2024-10-12 22:41:40,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940364095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:41:40,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:41:40,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:41:40,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018503813] [2024-10-12 22:41:40,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:41:40,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:41:40,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:41:40,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:41:40,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:41:40,387 INFO L87 Difference]: Start difference. First operand 54 states and 76 transitions. Second operand has 5 states, 5 states have (on average 3.6) 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-10-12 22:41:40,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:41:40,450 INFO L93 Difference]: Finished difference Result 110 states and 152 transitions. [2024-10-12 22:41:40,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:41:40,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) 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-10-12 22:41:40,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:41:40,452 INFO L225 Difference]: With dead ends: 110 [2024-10-12 22:41:40,452 INFO L226 Difference]: Without dead ends: 73 [2024-10-12 22:41:40,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:41:40,453 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 37 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:41:40,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 230 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:41:40,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-12 22:41:40,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2024-10-12 22:41:40,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:41:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2024-10-12 22:41:40,459 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 18 [2024-10-12 22:41:40,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:41:40,460 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2024-10-12 22:41:40,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) 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-10-12 22:41:40,460 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2024-10-12 22:41:40,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 22:41:40,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:41:40,461 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-10-12 22:41:40,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 22:41:40,462 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:41:40,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:41:40,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1795994527, now seen corresponding path program 1 times [2024-10-12 22:41:40,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:41:40,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649560546] [2024-10-12 22:41:40,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:41:40,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:41:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 22:41:40,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 22:41:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 22:41:40,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 22:41:40,526 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 22:41:40,527 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 22:41:40,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 22:41:40,531 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-12 22:41:40,555 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 22:41:40,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 10:41:40 BoogieIcfgContainer [2024-10-12 22:41:40,561 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 22:41:40,562 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 22:41:40,562 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 22:41:40,562 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 22:41:40,562 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:41:39" (3/4) ... [2024-10-12 22:41:40,564 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 22:41:40,565 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 22:41:40,568 INFO L158 Benchmark]: Toolchain (without parser) took 1960.57ms. Allocated memory was 125.8MB in the beginning and 211.8MB in the end (delta: 86.0MB). Free memory was 55.4MB in the beginning and 152.8MB in the end (delta: -97.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 22:41:40,569 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 22:41:40,570 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.93ms. Allocated memory was 125.8MB in the beginning and 174.1MB in the end (delta: 48.2MB). Free memory was 55.2MB in the beginning and 138.6MB in the end (delta: -83.4MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2024-10-12 22:41:40,570 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.32ms. Allocated memory is still 174.1MB. Free memory was 138.6MB in the beginning and 133.8MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 22:41:40,571 INFO L158 Benchmark]: Boogie Preprocessor took 44.85ms. Allocated memory is still 174.1MB. Free memory was 133.8MB in the beginning and 130.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 22:41:40,571 INFO L158 Benchmark]: RCFGBuilder took 473.53ms. Allocated memory is still 174.1MB. Free memory was 130.4MB in the beginning and 100.3MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-12 22:41:40,572 INFO L158 Benchmark]: TraceAbstraction took 1099.73ms. Allocated memory was 174.1MB in the beginning and 211.8MB in the end (delta: 37.7MB). Free memory was 99.8MB in the beginning and 152.8MB in the end (delta: -53.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 22:41:40,572 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 211.8MB. Free memory is still 152.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 22:41:40,573 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.14ms. Allocated memory is still 125.8MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.93ms. Allocated memory was 125.8MB in the beginning and 174.1MB in the end (delta: 48.2MB). Free memory was 55.2MB in the beginning and 138.6MB in the end (delta: -83.4MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.32ms. Allocated memory is still 174.1MB. Free memory was 138.6MB in the beginning and 133.8MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.85ms. Allocated memory is still 174.1MB. Free memory was 133.8MB in the beginning and 130.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 473.53ms. Allocated memory is still 174.1MB. Free memory was 130.4MB in the beginning and 100.3MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1099.73ms. Allocated memory was 174.1MB in the beginning and 211.8MB in the end (delta: 37.7MB). Free memory was 99.8MB in the beginning and 152.8MB in the end (delta: -53.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 211.8MB. Free memory is still 152.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, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 631 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 429 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 202 mSDtfsCounter, 62 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.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=3, InterpolantAutomatonStates: 13, 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, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 130 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-10-12 22:41:40,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.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.dk.eval-mul-div-a046e57-m [2024-10-12 22:41:42,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 22:41:42,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-12 22:41:42,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 22:41:42,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 22:41:42,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 22:41:42,434 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 22:41:42,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 22:41:42,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 22:41:42,438 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 22:41:42,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 22:41:42,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 22:41:42,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 22:41:42,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 22:41:42,439 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 22:41:42,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 22:41:42,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 22:41:42,440 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 22:41:42,440 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 22:41:42,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 22:41:42,440 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 22:41:42,440 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 22:41:42,440 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 22:41:42,441 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 22:41:42,441 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 22:41:42,441 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 22:41:42,441 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 22:41:42,441 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 22:41:42,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 22:41:42,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 22:41:42,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 22:41:42,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:41:42,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 22:41:42,442 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 22:41:42,443 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 22:41:42,443 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 22:41:42,443 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 22:41:42,443 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 22:41:42,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 22:41:42,443 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 22:41:42,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 22:41:42,444 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 22:41:42,444 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-10-12 22:41:42,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 22:41:42,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 22:41:42,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 22:41:42,723 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 22:41:42,723 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 22:41:42,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-10-12 22:41:44,026 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 22:41:44,189 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 22:41:44,190 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-10-12 22:41:44,196 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c2161427/3e94a6c40ab1466fa87173057f6bf402/FLAG2acb54d7b [2024-10-12 22:41:44,581 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c2161427/3e94a6c40ab1466fa87173057f6bf402 [2024-10-12 22:41:44,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 22:41:44,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 22:41:44,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 22:41:44,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 22:41:44,590 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 22:41:44,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:41:44" (1/1) ... [2024-10-12 22:41:44,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@790cbbef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:44, skipping insertion in model container [2024-10-12 22:41:44,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:41:44" (1/1) ... [2024-10-12 22:41:44,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 22:41:44,737 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1253,1266] [2024-10-12 22:41:44,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:41:44,792 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 22:41:44,801 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1253,1266] [2024-10-12 22:41:44,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:41:44,836 INFO L204 MainTranslator]: Completed translation [2024-10-12 22:41:44,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:44 WrapperNode [2024-10-12 22:41:44,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 22:41:44,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 22:41:44,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 22:41:44,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 22:41:44,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:44" (1/1) ... [2024-10-12 22:41:44,857 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:44" (1/1) ... [2024-10-12 22:41:44,875 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 108 [2024-10-12 22:41:44,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 22:41:44,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 22:41:44,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 22:41:44,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 22:41:44,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:44" (1/1) ... [2024-10-12 22:41:44,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:44" (1/1) ... [2024-10-12 22:41:44,891 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:44" (1/1) ... [2024-10-12 22:41:44,907 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 22:41:44,911 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:44" (1/1) ... [2024-10-12 22:41:44,912 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:44" (1/1) ... [2024-10-12 22:41:44,918 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:44" (1/1) ... [2024-10-12 22:41:44,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:44" (1/1) ... [2024-10-12 22:41:44,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:44" (1/1) ... [2024-10-12 22:41:44,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:44" (1/1) ... [2024-10-12 22:41:44,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 22:41:44,933 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 22:41:44,933 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 22:41:44,933 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 22:41:44,934 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:44" (1/1) ... [2024-10-12 22:41:44,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:41:44,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:41:44,962 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 22:41:44,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 22:41:44,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 22:41:44,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 22:41:44,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 22:41:44,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 22:41:45,067 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 22:41:45,069 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 22:41:45,246 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-12 22:41:45,248 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 22:41:45,275 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 22:41:45,276 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 22:41:45,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:41:45 BoogieIcfgContainer [2024-10-12 22:41:45,277 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 22:41:45,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 22:41:45,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 22:41:45,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 22:41:45,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 10:41:44" (1/3) ... [2024-10-12 22:41:45,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c77039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:41:45, skipping insertion in model container [2024-10-12 22:41:45,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:41:44" (2/3) ... [2024-10-12 22:41:45,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c77039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:41:45, skipping insertion in model container [2024-10-12 22:41:45,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:41:45" (3/3) ... [2024-10-12 22:41:45,285 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.dyn_partition.c [2024-10-12 22:41:45,298 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 22:41:45,298 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 22:41:45,338 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 22:41:45,343 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;@4d9cc839, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 22:41:45,343 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 22:41:45,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:41:45,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-12 22:41:45,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:41:45,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-12 22:41:45,351 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:41:45,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:41:45,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-12 22:41:45,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:41:45,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989420756] [2024-10-12 22:41:45,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:41:45,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:41:45,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:41:45,369 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 22:41:45,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-12 22:41:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:41:45,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 22:41:45,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:41:45,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:41:45,622 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 22:41:45,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 22:41:45,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989420756] [2024-10-12 22:41:45,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989420756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:41:45,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:41:45,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 22:41:45,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166636452] [2024-10-12 22:41:45,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:41:45,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:41:45,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 22:41:45,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:41:45,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:41:45,649 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:41:45,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:41:45,690 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-12 22:41:45,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:41:45,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-12 22:41:45,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:41:45,697 INFO L225 Difference]: With dead ends: 15 [2024-10-12 22:41:45,697 INFO L226 Difference]: Without dead ends: 9 [2024-10-12 22:41:45,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:41:45,702 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:41:45,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:41:45,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-12 22:41:45,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-12 22:41:45,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:41:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-12 22:41:45,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-12 22:41:45,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:41:45,724 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-12 22:41:45,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:41:45,725 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-12 22:41:45,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 22:41:45,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:41:45,726 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-12 22:41:45,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-12 22:41:45,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:41:45,928 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:41:45,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:41:45,929 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-12 22:41:45,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:41:45,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633311990] [2024-10-12 22:41:45,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:41:45,930 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:41:45,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:41:45,932 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 22:41:45,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-12 22:41:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:41:45,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-12 22:41:45,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:41:46,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:41:46,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 22:41:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:41:46,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 22:41:46,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633311990] [2024-10-12 22:41:46,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633311990] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 22:41:46,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 22:41:46,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-12 22:41:46,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94259111] [2024-10-12 22:41:46,618 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 22:41:46,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 22:41:46,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 22:41:46,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 22:41:46,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:41:46,621 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:41:46,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:41:46,699 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-10-12 22:41:46,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:41:46,699 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-12 22:41:46,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:41:46,700 INFO L225 Difference]: With dead ends: 14 [2024-10-12 22:41:46,700 INFO L226 Difference]: Without dead ends: 12 [2024-10-12 22:41:46,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-12 22:41:46,701 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:41:46,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 9 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:41:46,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-12 22:41:46,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2024-10-12 22:41:46,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:41:46,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-12 22:41:46,704 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-12 22:41:46,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:41:46,704 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-12 22:41:46,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:41:46,704 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-12 22:41:46,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 22:41:46,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:41:46,705 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-12 22:41:46,708 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-10-12 22:41:46,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:41:46,909 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:41:46,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:41:46,911 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-12 22:41:46,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:41:46,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590044135] [2024-10-12 22:41:46,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 22:41:46,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:41:46,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:41:46,914 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 22:41:46,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-12 22:41:46,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 22:41:46,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 22:41:46,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-12 22:41:46,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:41:47,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:41:47,262 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 22:41:48,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:41:48,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 22:41:48,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590044135] [2024-10-12 22:41:48,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1590044135] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 22:41:48,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 22:41:48,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-12 22:41:48,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21650763] [2024-10-12 22:41:48,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 22:41:48,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 22:41:48,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 22:41:48,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 22:41:48,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-12 22:41:48,237 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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-10-12 22:41:48,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:41:48,889 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2024-10-12 22:41:48,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 22:41:48,891 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 10 [2024-10-12 22:41:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:41:48,892 INFO L225 Difference]: With dead ends: 23 [2024-10-12 22:41:48,892 INFO L226 Difference]: Without dead ends: 21 [2024-10-12 22:41:48,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 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-10-12 22:41:48,893 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 22:41:48,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 12 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 22:41:48,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-12 22:41:48,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-10-12 22:41:48,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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-10-12 22:41:48,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2024-10-12 22:41:48,898 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 10 [2024-10-12 22:41:48,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:41:48,898 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2024-10-12 22:41:48,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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-10-12 22:41:48,899 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2024-10-12 22:41:48,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 22:41:48,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:41:48,899 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1] [2024-10-12 22:41:48,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-12 22:41:49,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:41:49,102 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:41:49,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:41:49,103 INFO L85 PathProgramCache]: Analyzing trace with hash -170586346, now seen corresponding path program 3 times [2024-10-12 22:41:49,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:41:49,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914829415] [2024-10-12 22:41:49,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 22:41:49,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:41:49,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:41:49,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 22:41:49,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-12 22:41:49,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-12 22:41:49,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 22:41:49,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-12 22:41:49,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:41:49,707 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:41:49,707 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 22:41:53,456 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:41:53,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 22:41:53,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914829415] [2024-10-12 22:41:53,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914829415] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 22:41:53,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 22:41:53,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-12 22:41:53,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875702978] [2024-10-12 22:41:53,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 22:41:53,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 22:41:53,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 22:41:53,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 22:41:53,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-10-12 22:41:53,459 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:41:57,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:41:57,285 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2024-10-12 22:41:57,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-12 22:41:57,286 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-10-12 22:41:57,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:41:57,286 INFO L225 Difference]: With dead ends: 41 [2024-10-12 22:41:57,287 INFO L226 Difference]: Without dead ends: 39 [2024-10-12 22:41:57,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=298, Invalid=694, Unknown=0, NotChecked=0, Total=992 [2024-10-12 22:41:57,288 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 12 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 22:41:57,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 25 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 22:41:57,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-12 22:41:57,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2024-10-12 22:41:57,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:41:57,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2024-10-12 22:41:57,296 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 19 [2024-10-12 22:41:57,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:41:57,296 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2024-10-12 22:41:57,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:41:57,296 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2024-10-12 22:41:57,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 22:41:57,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:41:57,297 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1] [2024-10-12 22:41:57,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-12 22:41:57,497 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-10-12 22:41:57,498 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:41:57,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:41:57,498 INFO L85 PathProgramCache]: Analyzing trace with hash -782942570, now seen corresponding path program 4 times [2024-10-12 22:41:57,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:41:57,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906769788] [2024-10-12 22:41:57,499 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 22:41:57,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:41:57,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:41:57,500 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-10-12 22:41:57,501 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-10-12 22:41:57,690 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 22:41:57,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 22:41:57,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-10-12 22:41:57,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:41:58,661 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:41:58,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 22:42:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:42:16,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 22:42:16,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906769788] [2024-10-12 22:42:16,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906769788] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 22:42:16,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 22:42:16,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 36 [2024-10-12 22:42:16,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328624013] [2024-10-12 22:42:16,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 22:42:16,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-12 22:42:16,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 22:42:16,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-12 22:42:16,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=1004, Unknown=0, NotChecked=0, Total=1332 [2024-10-12 22:42:16,993 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:42:34,559 WARN L286 SmtUtils]: Spent 5.34s on a formula simplification. DAG size of input: 951 DAG size of output: 923 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-12 22:42:52,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 22:42:56,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 22:43:11,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 22:43:16,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []