./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.h_b04.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 278b4de367ce9a5d90b72b56db7b4bfd32cdd3486043ecd2959c1028ac507b6e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:12:38,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:12:38,254 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 06:12:38,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:12:38,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:12:38,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:12:38,311 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:12:38,311 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:12:38,312 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:12:38,313 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:12:38,313 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:12:38,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:12:38,314 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:12:38,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:12:38,317 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:12:38,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:12:38,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:12:38,318 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 06:12:38,318 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:12:38,318 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:12:38,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:12:38,319 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:12:38,323 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:12:38,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:12:38,323 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:12:38,324 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:12:38,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:12:38,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:12:38,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:12:38,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:12:38,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:12:38,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:12:38,325 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:12:38,325 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 06:12:38,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 06:12:38,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:12:38,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:12:38,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:12:38,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:12:38,327 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-clean/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-clean/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 -> 278b4de367ce9a5d90b72b56db7b4bfd32cdd3486043ecd2959c1028ac507b6e [2024-10-11 06:12:38,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:12:38,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:12:38,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:12:38,624 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:12:38,625 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:12:38,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c [2024-10-11 06:12:40,112 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:12:40,292 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:12:40,293 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c [2024-10-11 06:12:40,304 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ca0a01fb7/fe826d2429384eca92ce9231c1e1da56/FLAG98c05ab5d [2024-10-11 06:12:40,322 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ca0a01fb7/fe826d2429384eca92ce9231c1e1da56 [2024-10-11 06:12:40,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:12:40,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:12:40,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:12:40,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:12:40,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:12:40,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:12:40" (1/1) ... [2024-10-11 06:12:40,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7855ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:40, skipping insertion in model container [2024-10-11 06:12:40,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:12:40" (1/1) ... [2024-10-11 06:12:40,392 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:12:40,568 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.h_b04.c[1245,1258] [2024-10-11 06:12:40,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:12:40,624 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:12:40,640 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.h_b04.c[1245,1258] [2024-10-11 06:12:40,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:12:40,683 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:12:40,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:40 WrapperNode [2024-10-11 06:12:40,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:12:40,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:12:40,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:12:40,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:12:40,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:40" (1/1) ... [2024-10-11 06:12:40,709 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:40" (1/1) ... [2024-10-11 06:12:40,752 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 216 [2024-10-11 06:12:40,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:12:40,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:12:40,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:12:40,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:12:40,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:40" (1/1) ... [2024-10-11 06:12:40,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:40" (1/1) ... [2024-10-11 06:12:40,777 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:40" (1/1) ... [2024-10-11 06:12:40,806 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-11 06:12:40,807 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:40" (1/1) ... [2024-10-11 06:12:40,807 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:40" (1/1) ... [2024-10-11 06:12:40,818 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:40" (1/1) ... [2024-10-11 06:12:40,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:40" (1/1) ... [2024-10-11 06:12:40,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:40" (1/1) ... [2024-10-11 06:12:40,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:40" (1/1) ... [2024-10-11 06:12:40,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:12:40,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:12:40,844 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:12:40,844 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:12:40,845 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:40" (1/1) ... [2024-10-11 06:12:40,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:12:40,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:12:40,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 06:12:40,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 06:12:40,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:12:40,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 06:12:40,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 06:12:40,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:12:40,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:12:41,050 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:12:41,055 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:12:41,494 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-10-11 06:12:41,494 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:12:41,528 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:12:41,529 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:12:41,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:12:41 BoogieIcfgContainer [2024-10-11 06:12:41,532 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:12:41,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:12:41,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:12:41,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:12:41,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:12:40" (1/3) ... [2024-10-11 06:12:41,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c90d75a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:12:41, skipping insertion in model container [2024-10-11 06:12:41,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:40" (2/3) ... [2024-10-11 06:12:41,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c90d75a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:12:41, skipping insertion in model container [2024-10-11 06:12:41,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:12:41" (3/3) ... [2024-10-11 06:12:41,544 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b04.c [2024-10-11 06:12:41,560 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:12:41,561 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:12:41,617 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:12:41,624 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;@3a7fee08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:12:41,625 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:12:41,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 42 states have internal predecessors, (62), 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-11 06:12:41,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 06:12:41,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:41,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:12:41,636 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:41,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:41,640 INFO L85 PathProgramCache]: Analyzing trace with hash -495221930, now seen corresponding path program 1 times [2024-10-11 06:12:41,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:41,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595199389] [2024-10-11 06:12:41,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:41,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:42,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:42,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:42,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595199389] [2024-10-11 06:12:42,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595199389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:42,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:42,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:12:42,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404538202] [2024-10-11 06:12:42,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:42,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:12:42,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:42,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:12:42,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:12:42,343 INFO L87 Difference]: Start difference. First operand has 43 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 42 states have internal predecessors, (62), 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 5.0) internal successors, (20), 4 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-11 06:12:42,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:42,399 INFO L93 Difference]: Finished difference Result 74 states and 108 transitions. [2024-10-11 06:12:42,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:12:42,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-11 06:12:42,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:42,413 INFO L225 Difference]: With dead ends: 74 [2024-10-11 06:12:42,413 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 06:12:42,417 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-11 06:12:42,423 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 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-11 06:12:42,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:12:42,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 06:12:42,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-11 06:12:42,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.441860465116279) internal successors, (62), 43 states have internal predecessors, (62), 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-11 06:12:42,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2024-10-11 06:12:42,459 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 20 [2024-10-11 06:12:42,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:42,460 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2024-10-11 06:12:42,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-11 06:12:42,461 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2024-10-11 06:12:42,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 06:12:42,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:42,462 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:12:42,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 06:12:42,462 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:42,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:42,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1829684611, now seen corresponding path program 1 times [2024-10-11 06:12:42,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:42,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616745949] [2024-10-11 06:12:42,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:42,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:42,642 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-11 06:12:42,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:42,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616745949] [2024-10-11 06:12:42,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616745949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:42,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:42,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:12:42,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640113270] [2024-10-11 06:12:42,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:42,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:12:42,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:42,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:12:42,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:12:42,650 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:42,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:42,688 INFO L93 Difference]: Finished difference Result 77 states and 108 transitions. [2024-10-11 06:12:42,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:12:42,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-11 06:12:42,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:42,697 INFO L225 Difference]: With dead ends: 77 [2024-10-11 06:12:42,697 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 06:12:42,697 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-11 06:12:42,698 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 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-11 06:12:42,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:12:42,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 06:12:42,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-11 06:12:42,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:42,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2024-10-11 06:12:42,711 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 21 [2024-10-11 06:12:42,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:42,711 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2024-10-11 06:12:42,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:42,711 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2024-10-11 06:12:42,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 06:12:42,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:42,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:12:42,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 06:12:42,715 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:42,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:42,717 INFO L85 PathProgramCache]: Analyzing trace with hash -212317745, now seen corresponding path program 1 times [2024-10-11 06:12:42,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:42,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406224589] [2024-10-11 06:12:42,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:42,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:43,108 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-11 06:12:43,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:43,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406224589] [2024-10-11 06:12:43,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406224589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:43,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:43,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:12:43,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127409068] [2024-10-11 06:12:43,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:43,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:12:43,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:43,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:12:43,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:12:43,111 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:43,148 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2024-10-11 06:12:43,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:12:43,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-11 06:12:43,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:43,151 INFO L225 Difference]: With dead ends: 79 [2024-10-11 06:12:43,151 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 06:12:43,153 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-11 06:12:43,154 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:43,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 151 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:12:43,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 06:12:43,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-11 06:12:43,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 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-11 06:12:43,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2024-10-11 06:12:43,167 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 22 [2024-10-11 06:12:43,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:43,167 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2024-10-11 06:12:43,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:43,168 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2024-10-11 06:12:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 06:12:43,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:43,169 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:12:43,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 06:12:43,169 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:43,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:43,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1377995894, now seen corresponding path program 1 times [2024-10-11 06:12:43,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:43,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222613717] [2024-10-11 06:12:43,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:43,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:43,613 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-11 06:12:43,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:43,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222613717] [2024-10-11 06:12:43,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222613717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:43,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:43,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:12:43,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50460757] [2024-10-11 06:12:43,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:43,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 06:12:43,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:43,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 06:12:43,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:12:43,619 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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-11 06:12:43,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:43,779 INFO L93 Difference]: Finished difference Result 89 states and 121 transitions. [2024-10-11 06:12:43,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:12:43,780 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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 23 [2024-10-11 06:12:43,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:43,781 INFO L225 Difference]: With dead ends: 89 [2024-10-11 06:12:43,781 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 06:12:43,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:12:43,782 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 68 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:43,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 296 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:12:43,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 06:12:43,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-10-11 06:12:43,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 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-11 06:12:43,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2024-10-11 06:12:43,795 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 75 transitions. Word has length 23 [2024-10-11 06:12:43,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:43,796 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 75 transitions. [2024-10-11 06:12:43,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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-11 06:12:43,797 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 75 transitions. [2024-10-11 06:12:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 06:12:43,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:43,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:12:43,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 06:12:43,799 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:43,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:43,801 INFO L85 PathProgramCache]: Analyzing trace with hash 551146636, now seen corresponding path program 1 times [2024-10-11 06:12:43,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:43,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580315612] [2024-10-11 06:12:43,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:43,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:44,135 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-11 06:12:44,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:44,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580315612] [2024-10-11 06:12:44,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580315612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:44,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:44,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:12:44,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580456243] [2024-10-11 06:12:44,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:44,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:12:44,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:44,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:12:44,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:12:44,141 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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-11 06:12:44,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:44,191 INFO L93 Difference]: Finished difference Result 103 states and 139 transitions. [2024-10-11 06:12:44,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:12:44,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2024-10-11 06:12:44,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:44,194 INFO L225 Difference]: With dead ends: 103 [2024-10-11 06:12:44,194 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 06:12:44,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:12:44,196 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 51 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:44,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 156 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:12:44,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 06:12:44,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-11 06:12:44,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 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-11 06:12:44,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2024-10-11 06:12:44,208 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 24 [2024-10-11 06:12:44,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:44,213 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2024-10-11 06:12:44,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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-11 06:12:44,213 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2024-10-11 06:12:44,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 06:12:44,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:44,214 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:12:44,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 06:12:44,214 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:44,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:44,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1076941601, now seen corresponding path program 1 times [2024-10-11 06:12:44,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:44,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619962221] [2024-10-11 06:12:44,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:44,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:44,463 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-11 06:12:44,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:44,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619962221] [2024-10-11 06:12:44,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619962221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:44,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:44,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:12:44,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8304010] [2024-10-11 06:12:44,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:44,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:12:44,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:44,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:12:44,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:12:44,468 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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-11 06:12:44,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:44,581 INFO L93 Difference]: Finished difference Result 141 states and 183 transitions. [2024-10-11 06:12:44,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:12:44,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2024-10-11 06:12:44,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:44,583 INFO L225 Difference]: With dead ends: 141 [2024-10-11 06:12:44,583 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 06:12:44,584 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-11 06:12:44,584 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 41 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:44,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 115 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:12:44,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 06:12:44,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2024-10-11 06:12:44,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 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-11 06:12:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2024-10-11 06:12:44,597 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 24 [2024-10-11 06:12:44,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:44,600 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2024-10-11 06:12:44,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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-11 06:12:44,600 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2024-10-11 06:12:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 06:12:44,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:44,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:12:44,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 06:12:44,601 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:44,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:44,602 INFO L85 PathProgramCache]: Analyzing trace with hash -904526706, now seen corresponding path program 1 times [2024-10-11 06:12:44,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:44,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404953908] [2024-10-11 06:12:44,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:44,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:44,806 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-11 06:12:44,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:44,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404953908] [2024-10-11 06:12:44,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404953908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:44,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:44,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:12:44,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494024611] [2024-10-11 06:12:44,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:44,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:12:44,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:44,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:12:44,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:12:44,811 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-11 06:12:44,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:44,908 INFO L93 Difference]: Finished difference Result 123 states and 158 transitions. [2024-10-11 06:12:44,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:12:44,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2024-10-11 06:12:44,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:44,910 INFO L225 Difference]: With dead ends: 123 [2024-10-11 06:12:44,911 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 06:12:44,911 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-11 06:12:44,912 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 23 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:44,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 123 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:12:44,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 06:12:44,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2024-10-11 06:12:44,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 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-11 06:12:44,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2024-10-11 06:12:44,925 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 25 [2024-10-11 06:12:44,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:44,925 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2024-10-11 06:12:44,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-11 06:12:44,926 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2024-10-11 06:12:44,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 06:12:44,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:44,927 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:12:44,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 06:12:44,927 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:44,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:44,930 INFO L85 PathProgramCache]: Analyzing trace with hash 726058961, now seen corresponding path program 1 times [2024-10-11 06:12:44,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:44,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249105632] [2024-10-11 06:12:44,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:44,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:45,331 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:45,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:45,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249105632] [2024-10-11 06:12:45,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249105632] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 06:12:45,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754246037] [2024-10-11 06:12:45,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:45,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:12:45,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:12:45,336 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 06:12:45,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 06:12:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:45,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-11 06:12:45,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:12:45,726 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:45,727 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 06:12:45,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754246037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:45,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 06:12:45,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-10-11 06:12:45,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13032195] [2024-10-11 06:12:45,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:45,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:12:45,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:45,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:12:45,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:12:45,732 INFO L87 Difference]: Start difference. First operand 65 states and 85 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:45,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:45,840 INFO L93 Difference]: Finished difference Result 125 states and 161 transitions. [2024-10-11 06:12:45,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:12:45,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-10-11 06:12:45,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:45,842 INFO L225 Difference]: With dead ends: 125 [2024-10-11 06:12:45,842 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 06:12:45,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-11 06:12:45,844 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 70 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:45,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 88 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:12:45,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 06:12:45,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-11 06:12:45,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 76 states have internal predecessors, (97), 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-11 06:12:45,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2024-10-11 06:12:45,849 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 40 [2024-10-11 06:12:45,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:45,849 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2024-10-11 06:12:45,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:45,850 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2024-10-11 06:12:45,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 06:12:45,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:45,851 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:12:45,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 06:12:46,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:12:46,056 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:46,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:46,057 INFO L85 PathProgramCache]: Analyzing trace with hash -774055173, now seen corresponding path program 1 times [2024-10-11 06:12:46,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:46,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578155157] [2024-10-11 06:12:46,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:46,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:46,576 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:46,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:46,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578155157] [2024-10-11 06:12:46,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578155157] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 06:12:46,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417552490] [2024-10-11 06:12:46,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:46,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:12:46,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:12:46,579 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 06:12:46,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 06:12:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:46,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 06:12:46,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:12:46,945 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:46,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:12:47,369 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:47,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417552490] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:12:47,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 06:12:47,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2024-10-11 06:12:47,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757868466] [2024-10-11 06:12:47,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 06:12:47,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 06:12:47,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:47,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 06:12:47,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-10-11 06:12:47,372 INFO L87 Difference]: Start difference. First operand 77 states and 97 transitions. Second operand has 19 states, 19 states have (on average 5.0) internal successors, (95), 18 states have internal predecessors, (95), 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-11 06:12:47,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:47,666 INFO L93 Difference]: Finished difference Result 158 states and 200 transitions. [2024-10-11 06:12:47,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 06:12:47,667 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.0) internal successors, (95), 18 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-10-11 06:12:47,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:47,668 INFO L225 Difference]: With dead ends: 158 [2024-10-11 06:12:47,668 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 06:12:47,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2024-10-11 06:12:47,669 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 70 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:47,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 373 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:12:47,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 06:12:47,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2024-10-11 06:12:47,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 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-11 06:12:47,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2024-10-11 06:12:47,679 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 41 [2024-10-11 06:12:47,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:47,679 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2024-10-11 06:12:47,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.0) internal successors, (95), 18 states have internal predecessors, (95), 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-11 06:12:47,680 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2024-10-11 06:12:47,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 06:12:47,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:47,681 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:12:47,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 06:12:47,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:12:47,882 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:47,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:47,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1844115444, now seen corresponding path program 1 times [2024-10-11 06:12:47,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:47,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558147916] [2024-10-11 06:12:47,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:47,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:48,645 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 06:12:48,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:48,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558147916] [2024-10-11 06:12:48,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558147916] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 06:12:48,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020594183] [2024-10-11 06:12:48,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:48,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:12:48,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:12:48,648 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 06:12:48,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 06:12:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:48,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-11 06:12:48,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:12:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 06:12:49,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:12:51,000 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:51,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020594183] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:12:51,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 06:12:51,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 12] total 28 [2024-10-11 06:12:51,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640770802] [2024-10-11 06:12:51,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 06:12:51,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 06:12:51,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:51,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 06:12:51,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2024-10-11 06:12:51,005 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand has 29 states, 29 states have (on average 3.8620689655172415) internal successors, (112), 28 states have internal predecessors, (112), 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-11 06:12:51,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:51,614 INFO L93 Difference]: Finished difference Result 133 states and 169 transitions. [2024-10-11 06:12:51,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 06:12:51,614 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.8620689655172415) internal successors, (112), 28 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-10-11 06:12:51,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:51,615 INFO L225 Difference]: With dead ends: 133 [2024-10-11 06:12:51,615 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 06:12:51,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2024-10-11 06:12:51,619 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 140 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:51,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 241 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 06:12:51,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 06:12:51,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2024-10-11 06:12:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 83 states have internal predecessors, (105), 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-11 06:12:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2024-10-11 06:12:51,627 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 42 [2024-10-11 06:12:51,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:51,628 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2024-10-11 06:12:51,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.8620689655172415) internal successors, (112), 28 states have internal predecessors, (112), 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-11 06:12:51,628 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2024-10-11 06:12:51,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 06:12:51,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:51,630 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:12:51,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 06:12:51,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:12:51,832 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:51,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:51,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1397418175, now seen corresponding path program 1 times [2024-10-11 06:12:51,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:51,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246124632] [2024-10-11 06:12:51,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:51,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:52,328 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:52,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:52,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246124632] [2024-10-11 06:12:52,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246124632] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 06:12:52,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254998393] [2024-10-11 06:12:52,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:52,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:12:52,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:12:52,331 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 06:12:52,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 06:12:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:52,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-11 06:12:52,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:12:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:52,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:12:53,324 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:53,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254998393] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:12:53,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 06:12:53,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 17 [2024-10-11 06:12:53,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637523031] [2024-10-11 06:12:53,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 06:12:53,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 06:12:53,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:53,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 06:12:53,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-10-11 06:12:53,326 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 17 states have internal predecessors, (84), 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-11 06:12:53,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:53,589 INFO L93 Difference]: Finished difference Result 148 states and 185 transitions. [2024-10-11 06:12:53,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 06:12:53,591 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-10-11 06:12:53,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:53,591 INFO L225 Difference]: With dead ends: 148 [2024-10-11 06:12:53,591 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 06:12:53,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2024-10-11 06:12:53,593 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 35 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:53,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 247 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:12:53,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 06:12:53,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2024-10-11 06:12:53,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 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-11 06:12:53,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2024-10-11 06:12:53,602 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 43 [2024-10-11 06:12:53,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:53,604 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2024-10-11 06:12:53,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 17 states have internal predecessors, (84), 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-11 06:12:53,605 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2024-10-11 06:12:53,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 06:12:53,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:53,606 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:12:53,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 06:12:53,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 06:12:53,807 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:53,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:53,809 INFO L85 PathProgramCache]: Analyzing trace with hash 984341419, now seen corresponding path program 1 times [2024-10-11 06:12:53,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:53,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118193589] [2024-10-11 06:12:53,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:53,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:55,394 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:55,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:55,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118193589] [2024-10-11 06:12:55,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118193589] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 06:12:55,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586043075] [2024-10-11 06:12:55,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:55,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:12:55,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:12:55,398 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 06:12:55,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 06:12:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:55,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-11 06:12:55,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:12:56,009 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 37 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:56,009 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:12:57,095 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 34 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:57,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586043075] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:12:57,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 06:12:57,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 14] total 32 [2024-10-11 06:12:57,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184178729] [2024-10-11 06:12:57,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 06:12:57,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 06:12:57,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:57,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 06:12:57,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=858, Unknown=0, NotChecked=0, Total=992 [2024-10-11 06:12:57,102 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand has 32 states, 32 states have (on average 4.875) internal successors, (156), 32 states have internal predecessors, (156), 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-11 06:12:58,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:58,555 INFO L93 Difference]: Finished difference Result 215 states and 268 transitions. [2024-10-11 06:12:58,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-11 06:12:58,556 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.875) internal successors, (156), 32 states have internal predecessors, (156), 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 57 [2024-10-11 06:12:58,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:58,557 INFO L225 Difference]: With dead ends: 215 [2024-10-11 06:12:58,557 INFO L226 Difference]: Without dead ends: 163 [2024-10-11 06:12:58,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=539, Invalid=3367, Unknown=0, NotChecked=0, Total=3906 [2024-10-11 06:12:58,559 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 302 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:58,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 702 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 06:12:58,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-11 06:12:58,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 81. [2024-10-11 06:12:58,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.2375) internal successors, (99), 80 states have internal predecessors, (99), 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-11 06:12:58,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2024-10-11 06:12:58,564 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 57 [2024-10-11 06:12:58,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:58,565 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2024-10-11 06:12:58,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.875) internal successors, (156), 32 states have internal predecessors, (156), 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-11 06:12:58,565 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2024-10-11 06:12:58,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 06:12:58,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:58,569 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:12:58,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 06:12:58,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 06:12:58,771 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:58,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:58,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1564006215, now seen corresponding path program 1 times [2024-10-11 06:12:58,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:58,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706748973] [2024-10-11 06:12:58,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:58,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:59,357 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 06:12:59,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:59,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706748973] [2024-10-11 06:12:59,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706748973] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 06:12:59,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051264985] [2024-10-11 06:12:59,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:59,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:12:59,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:12:59,361 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 06:12:59,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 06:12:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:59,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-11 06:12:59,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:12:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 06:12:59,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:13:00,732 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 06:13:00,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051264985] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:13:00,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 06:13:00,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 11] total 21 [2024-10-11 06:13:00,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873762084] [2024-10-11 06:13:00,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 06:13:00,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 06:13:00,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:13:00,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 06:13:00,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-10-11 06:13:00,736 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand has 22 states, 22 states have (on average 6.545454545454546) internal successors, (144), 21 states have internal predecessors, (144), 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-11 06:13:01,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:13:01,297 INFO L93 Difference]: Finished difference Result 180 states and 222 transitions. [2024-10-11 06:13:01,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 06:13:01,297 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.545454545454546) internal successors, (144), 21 states have internal predecessors, (144), 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 58 [2024-10-11 06:13:01,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:13:01,298 INFO L225 Difference]: With dead ends: 180 [2024-10-11 06:13:01,298 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 06:13:01,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=836, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 06:13:01,300 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 112 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 06:13:01,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 405 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 06:13:01,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 06:13:01,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 84. [2024-10-11 06:13:01,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.216867469879518) internal successors, (101), 83 states have internal predecessors, (101), 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-11 06:13:01,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2024-10-11 06:13:01,305 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 58 [2024-10-11 06:13:01,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:13:01,305 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2024-10-11 06:13:01,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.545454545454546) internal successors, (144), 21 states have internal predecessors, (144), 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-11 06:13:01,306 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2024-10-11 06:13:01,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 06:13:01,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:13:01,306 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:13:01,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 06:13:01,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 06:13:01,507 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:13:01,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:13:01,508 INFO L85 PathProgramCache]: Analyzing trace with hash 499559409, now seen corresponding path program 1 times [2024-10-11 06:13:01,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:13:01,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015593426] [2024-10-11 06:13:01,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:13:01,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:13:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:13:02,980 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:13:02,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:13:02,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015593426] [2024-10-11 06:13:02,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015593426] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 06:13:02,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415394224] [2024-10-11 06:13:02,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:13:02,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:13:02,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:13:02,983 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 06:13:02,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 06:13:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:13:03,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-10-11 06:13:03,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:13:03,582 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:13:03,582 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:13:04,195 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 35 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:13:04,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415394224] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:13:04,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 06:13:04,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 35 [2024-10-11 06:13:04,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520779318] [2024-10-11 06:13:04,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 06:13:04,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 06:13:04,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:13:04,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 06:13:04,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 06:13:04,198 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand has 35 states, 35 states have (on average 4.628571428571429) internal successors, (162), 35 states have internal predecessors, (162), 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-11 06:13:05,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:13:05,530 INFO L93 Difference]: Finished difference Result 177 states and 208 transitions. [2024-10-11 06:13:05,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-11 06:13:05,530 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.628571428571429) internal successors, (162), 35 states have internal predecessors, (162), 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 59 [2024-10-11 06:13:05,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:13:05,531 INFO L225 Difference]: With dead ends: 177 [2024-10-11 06:13:05,531 INFO L226 Difference]: Without dead ends: 127 [2024-10-11 06:13:05,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=730, Invalid=4240, Unknown=0, NotChecked=0, Total=4970 [2024-10-11 06:13:05,534 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 262 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 06:13:05,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 543 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 06:13:05,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-11 06:13:05,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 70. [2024-10-11 06:13:05,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 69 states have internal predecessors, (83), 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-11 06:13:05,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2024-10-11 06:13:05,538 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 59 [2024-10-11 06:13:05,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:13:05,539 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2024-10-11 06:13:05,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.628571428571429) internal successors, (162), 35 states have internal predecessors, (162), 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-11 06:13:05,539 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2024-10-11 06:13:05,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 06:13:05,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:13:05,541 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:13:05,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 06:13:05,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:13:05,742 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:13:05,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:13:05,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1558898799, now seen corresponding path program 1 times [2024-10-11 06:13:05,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:13:05,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564852760] [2024-10-11 06:13:05,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:13:05,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:13:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:13:05,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 06:13:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:13:06,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 06:13:06,055 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 06:13:06,056 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 06:13:06,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 06:13:06,060 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:13:06,118 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 06:13:06,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:13:06 BoogieIcfgContainer [2024-10-11 06:13:06,124 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 06:13:06,125 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 06:13:06,125 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 06:13:06,125 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 06:13:06,125 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:12:41" (3/4) ... [2024-10-11 06:13:06,128 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 06:13:06,129 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 06:13:06,129 INFO L158 Benchmark]: Toolchain (without parser) took 25802.04ms. Allocated memory was 134.2MB in the beginning and 536.9MB in the end (delta: 402.7MB). Free memory was 64.4MB in the beginning and 264.1MB in the end (delta: -199.7MB). Peak memory consumption was 205.4MB. Max. memory is 16.1GB. [2024-10-11 06:13:06,129 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 134.2MB. Free memory was 99.6MB in the beginning and 99.5MB in the end (delta: 53.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:13:06,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.78ms. Allocated memory was 134.2MB in the beginning and 197.1MB in the end (delta: 62.9MB). Free memory was 64.2MB in the beginning and 158.5MB in the end (delta: -94.2MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2024-10-11 06:13:06,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.39ms. Allocated memory is still 197.1MB. Free memory was 158.5MB in the beginning and 154.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 06:13:06,131 INFO L158 Benchmark]: Boogie Preprocessor took 88.91ms. Allocated memory is still 197.1MB. Free memory was 154.3MB in the beginning and 151.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 06:13:06,131 INFO L158 Benchmark]: RCFGBuilder took 688.71ms. Allocated memory is still 197.1MB. Free memory was 151.0MB in the beginning and 122.9MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 06:13:06,131 INFO L158 Benchmark]: TraceAbstraction took 24589.23ms. Allocated memory was 197.1MB in the beginning and 536.9MB in the end (delta: 339.7MB). Free memory was 121.6MB in the beginning and 264.1MB in the end (delta: -142.5MB). Peak memory consumption was 197.1MB. Max. memory is 16.1GB. [2024-10-11 06:13:06,132 INFO L158 Benchmark]: Witness Printer took 4.20ms. Allocated memory is still 536.9MB. Free memory is still 264.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:13:06,133 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 134.2MB. Free memory was 99.6MB in the beginning and 99.5MB in the end (delta: 53.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.78ms. Allocated memory was 134.2MB in the beginning and 197.1MB in the end (delta: 62.9MB). Free memory was 64.2MB in the beginning and 158.5MB in the end (delta: -94.2MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.39ms. Allocated memory is still 197.1MB. Free memory was 158.5MB in the beginning and 154.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.91ms. Allocated memory is still 197.1MB. Free memory was 154.3MB in the beginning and 151.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 688.71ms. Allocated memory is still 197.1MB. Free memory was 151.0MB in the beginning and 122.9MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 24589.23ms. Allocated memory was 197.1MB in the beginning and 536.9MB in the end (delta: 339.7MB). Free memory was 121.6MB in the beginning and 264.1MB in the end (delta: -142.5MB). Peak memory consumption was 197.1MB. Max. memory is 16.1GB. * Witness Printer took 4.20ms. Allocated memory is still 536.9MB. Free memory is still 264.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 97. 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 - 8); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (8 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 32); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (32 - 1); [L35] const SORT_4 var_8 = 0; [L36] const SORT_12 var_14 = 1; [L37] const SORT_1 var_25 = 1; [L38] const SORT_1 var_42 = 0; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L42] SORT_4 input_5; [L43] SORT_1 input_6; [L44] SORT_1 input_7; [L45] SORT_4 input_29; [L46] SORT_4 input_31; [L47] SORT_4 input_33; [L48] SORT_4 input_35; [L49] SORT_4 input_37; [L50] SORT_4 input_39; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=255, var_14=1, var_25=1, var_42=0, var_8=0] [L52] SORT_4 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, var_14=1, var_25=1, var_42=0, var_8=0] [L53] SORT_4 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_14=1, var_25=1, var_42=0, var_8=0] [L54] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L56] SORT_4 init_10_arg_1 = var_8; [L57] state_9 = init_10_arg_1 [L58] SORT_4 init_18_arg_1 = var_8; [L59] state_17 = init_18_arg_1 [L60] SORT_1 init_44_arg_1 = var_42; [L61] state_43 = init_44_arg_1 VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_42=0] [L64] input_2 = __VERIFIER_nondet_uchar() [L65] input_3 = __VERIFIER_nondet_uchar() [L66] input_5 = __VERIFIER_nondet_uchar() [L67] input_6 = __VERIFIER_nondet_uchar() [L68] input_7 = __VERIFIER_nondet_uchar() [L69] input_29 = __VERIFIER_nondet_uchar() [L70] input_31 = __VERIFIER_nondet_uchar() [L71] input_33 = __VERIFIER_nondet_uchar() [L72] input_35 = __VERIFIER_nondet_uchar() [L73] input_37 = __VERIFIER_nondet_uchar() [L74] input_39 = __VERIFIER_nondet_uchar() [L77] SORT_4 var_11_arg_0 = state_9; [L78] SORT_1 var_11 = var_11_arg_0 >> 7; [L79] SORT_1 var_13_arg_0 = var_11; VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_13_arg_0=0, var_14=1, var_25=1, var_42=0] [L80] EXPR var_13_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_42=0] [L80] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L81] SORT_12 var_13 = var_13_arg_0; [L82] SORT_12 var_15_arg_0 = var_13; [L83] SORT_12 var_15_arg_1 = var_14; [L84] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L85] SORT_1 var_16_arg_0 = var_15; [L86] SORT_1 var_16 = ~var_16_arg_0; [L87] SORT_4 var_19_arg_0 = state_17; [L88] SORT_1 var_19 = var_19_arg_0 >> 7; [L89] SORT_1 var_20_arg_0 = var_19; VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_16=-1, var_20_arg_0=0, var_25=1, var_42=0] [L90] EXPR var_20_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_16=-1, var_25=1, var_42=0] [L90] var_20_arg_0 = var_20_arg_0 & mask_SORT_1 [L91] SORT_12 var_20 = var_20_arg_0; [L92] SORT_12 var_21_arg_0 = var_20; [L93] SORT_12 var_21_arg_1 = var_14; [L94] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L95] SORT_1 var_22_arg_0 = var_16; [L96] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_22_arg_0=-1, var_22_arg_1=0, var_25=1, var_42=0] [L97] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_42=0] [L97] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L98] SORT_1 var_26_arg_0 = var_22; [L99] SORT_1 var_26 = ~var_26_arg_0; [L100] SORT_1 var_27_arg_0 = var_25; [L101] SORT_1 var_27_arg_1 = var_26; VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_27_arg_0=1, var_27_arg_1=-256, var_42=0] [L102] EXPR var_27_arg_0 & var_27_arg_1 VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_42=0] [L102] SORT_1 var_27 = var_27_arg_0 & var_27_arg_1; [L103] EXPR var_27 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_42=0] [L103] var_27 = var_27 & mask_SORT_1 [L104] SORT_1 bad_28_arg_0 = var_27; [L105] CALL __VERIFIER_assert(!(bad_28_arg_0)) [L21] COND FALSE !(!(cond)) [L105] RET __VERIFIER_assert(!(bad_28_arg_0)) [L107] SORT_1 var_45_arg_0 = state_43; [L108] SORT_4 var_45_arg_1 = input_5; [L109] SORT_4 var_45_arg_2 = state_9; [L110] SORT_4 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; [L111] SORT_4 next_46_arg_1 = var_45; [L112] SORT_1 var_47_arg_0 = state_43; [L113] SORT_4 var_47_arg_1 = input_5; [L114] SORT_4 var_47_arg_2 = state_17; [L115] SORT_4 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L116] SORT_4 next_48_arg_1 = var_47; [L117] SORT_1 var_49_arg_0 = state_43; [L118] SORT_1 var_49_arg_1 = var_42; [L119] SORT_1 var_49_arg_2 = var_25; [L120] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; VAL [mask_SORT_1=1, next_46_arg_1=0, next_48_arg_1=0, var_14=1, var_25=1, var_42=0, var_49=1] [L121] EXPR var_49 & mask_SORT_1 VAL [mask_SORT_1=1, next_46_arg_1=0, next_48_arg_1=0, var_14=1, var_25=1, var_42=0] [L121] var_49 = var_49 & mask_SORT_1 [L122] SORT_1 next_50_arg_1 = var_49; [L124] state_9 = next_46_arg_1 [L125] state_17 = next_48_arg_1 [L126] state_43 = next_50_arg_1 [L64] input_2 = __VERIFIER_nondet_uchar() [L65] input_3 = __VERIFIER_nondet_uchar() [L66] input_5 = __VERIFIER_nondet_uchar() [L67] input_6 = __VERIFIER_nondet_uchar() [L68] input_7 = __VERIFIER_nondet_uchar() [L69] input_29 = __VERIFIER_nondet_uchar() [L70] input_31 = __VERIFIER_nondet_uchar() [L71] input_33 = __VERIFIER_nondet_uchar() [L72] input_35 = __VERIFIER_nondet_uchar() [L73] input_37 = __VERIFIER_nondet_uchar() [L74] input_39 = __VERIFIER_nondet_uchar() [L77] SORT_4 var_11_arg_0 = state_9; [L78] SORT_1 var_11 = var_11_arg_0 >> 7; [L79] SORT_1 var_13_arg_0 = var_11; VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_13_arg_0=0, var_14=1, var_25=1, var_42=0] [L80] EXPR var_13_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_25=1, var_42=0] [L80] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L81] SORT_12 var_13 = var_13_arg_0; [L82] SORT_12 var_15_arg_0 = var_13; [L83] SORT_12 var_15_arg_1 = var_14; [L84] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L85] SORT_1 var_16_arg_0 = var_15; [L86] SORT_1 var_16 = ~var_16_arg_0; [L87] SORT_4 var_19_arg_0 = state_17; [L88] SORT_1 var_19 = var_19_arg_0 >> 7; [L89] SORT_1 var_20_arg_0 = var_19; VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_16=-1, var_20_arg_0=0, var_25=1, var_42=0] [L90] EXPR var_20_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_16=-1, var_25=1, var_42=0] [L90] var_20_arg_0 = var_20_arg_0 & mask_SORT_1 [L91] SORT_12 var_20 = var_20_arg_0; [L92] SORT_12 var_21_arg_0 = var_20; [L93] SORT_12 var_21_arg_1 = var_14; [L94] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L95] SORT_1 var_22_arg_0 = var_16; [L96] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_22_arg_0=-1, var_22_arg_1=0, var_25=1, var_42=0] [L97] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_25=1, var_42=0] [L97] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L98] SORT_1 var_26_arg_0 = var_22; [L99] SORT_1 var_26 = ~var_26_arg_0; [L100] SORT_1 var_27_arg_0 = var_25; [L101] SORT_1 var_27_arg_1 = var_26; VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_25=1, var_27_arg_0=1, var_27_arg_1=-256, var_42=0] [L102] EXPR var_27_arg_0 & var_27_arg_1 VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_25=1, var_42=0] [L102] SORT_1 var_27 = var_27_arg_0 & var_27_arg_1; [L103] EXPR var_27 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_25=1, var_42=0] [L103] var_27 = var_27 & mask_SORT_1 [L104] SORT_1 bad_28_arg_0 = var_27; [L105] CALL __VERIFIER_assert(!(bad_28_arg_0)) [L21] COND FALSE !(!(cond)) [L105] RET __VERIFIER_assert(!(bad_28_arg_0)) [L107] SORT_1 var_45_arg_0 = state_43; [L108] SORT_4 var_45_arg_1 = input_5; [L109] SORT_4 var_45_arg_2 = state_9; [L110] SORT_4 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; [L111] SORT_4 next_46_arg_1 = var_45; [L112] SORT_1 var_47_arg_0 = state_43; [L113] SORT_4 var_47_arg_1 = input_5; [L114] SORT_4 var_47_arg_2 = state_17; [L115] SORT_4 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L116] SORT_4 next_48_arg_1 = var_47; [L117] SORT_1 var_49_arg_0 = state_43; [L118] SORT_1 var_49_arg_1 = var_42; [L119] SORT_1 var_49_arg_2 = var_25; [L120] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; VAL [mask_SORT_1=1, next_46_arg_1=255, next_48_arg_1=255, var_14=1, var_25=1, var_42=0, var_49=0] [L121] EXPR var_49 & mask_SORT_1 VAL [mask_SORT_1=1, next_46_arg_1=255, next_48_arg_1=255, var_14=1, var_25=1, var_42=0] [L121] var_49 = var_49 & mask_SORT_1 [L122] SORT_1 next_50_arg_1 = var_49; [L124] state_9 = next_46_arg_1 [L125] state_17 = next_48_arg_1 [L126] state_43 = next_50_arg_1 [L64] input_2 = __VERIFIER_nondet_uchar() [L65] input_3 = __VERIFIER_nondet_uchar() [L66] input_5 = __VERIFIER_nondet_uchar() [L67] input_6 = __VERIFIER_nondet_uchar() [L68] input_7 = __VERIFIER_nondet_uchar() [L69] input_29 = __VERIFIER_nondet_uchar() [L70] input_31 = __VERIFIER_nondet_uchar() [L71] input_33 = __VERIFIER_nondet_uchar() [L72] input_35 = __VERIFIER_nondet_uchar() [L73] input_37 = __VERIFIER_nondet_uchar() [L74] input_39 = __VERIFIER_nondet_uchar() [L77] SORT_4 var_11_arg_0 = state_9; [L78] SORT_1 var_11 = var_11_arg_0 >> 7; [L79] SORT_1 var_13_arg_0 = var_11; VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_13_arg_0=1, var_14=1, var_25=1, var_42=0] [L80] EXPR var_13_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_25=1, var_42=0] [L80] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L81] SORT_12 var_13 = var_13_arg_0; [L82] SORT_12 var_15_arg_0 = var_13; [L83] SORT_12 var_15_arg_1 = var_14; [L84] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L85] SORT_1 var_16_arg_0 = var_15; [L86] SORT_1 var_16 = ~var_16_arg_0; [L87] SORT_4 var_19_arg_0 = state_17; [L88] SORT_1 var_19 = var_19_arg_0 >> 7; [L89] SORT_1 var_20_arg_0 = var_19; VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_16=-2, var_20_arg_0=1, var_25=1, var_42=0] [L90] EXPR var_20_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_16=-2, var_25=1, var_42=0] [L90] var_20_arg_0 = var_20_arg_0 & mask_SORT_1 [L91] SORT_12 var_20 = var_20_arg_0; [L92] SORT_12 var_21_arg_0 = var_20; [L93] SORT_12 var_21_arg_1 = var_14; [L94] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L95] SORT_1 var_22_arg_0 = var_16; [L96] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_22_arg_0=-2, var_22_arg_1=1, var_25=1, var_42=0] [L97] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_25=1, var_42=0] [L97] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L98] SORT_1 var_26_arg_0 = var_22; [L99] SORT_1 var_26 = ~var_26_arg_0; [L100] SORT_1 var_27_arg_0 = var_25; [L101] SORT_1 var_27_arg_1 = var_26; VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_25=1, var_27_arg_0=1, var_27_arg_1=-255, var_42=0] [L102] EXPR var_27_arg_0 & var_27_arg_1 VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_25=1, var_42=0] [L102] SORT_1 var_27 = var_27_arg_0 & var_27_arg_1; [L103] EXPR var_27 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_25=1, var_42=0] [L103] var_27 = var_27 & mask_SORT_1 [L104] SORT_1 bad_28_arg_0 = var_27; [L105] CALL __VERIFIER_assert(!(bad_28_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.5s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1180 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1180 mSDsluCounter, 3769 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3153 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3785 IncrementalHoareTripleChecker+Invalid, 3831 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 616 mSDtfsCounter, 3785 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 851 GetRequests, 575 SyntacticMatches, 3 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2562 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=11, InterpolantAutomatonStates: 166, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 270 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 898 NumberOfCodeBlocks, 898 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1112 ConstructedInterpolants, 0 QuantifiedInterpolants, 12180 SizeOfPredicates, 24 NumberOfNonLiveVariables, 2334 ConjunctsInSsa, 351 ConjunctsInUnsatCore, 27 InterpolantComputations, 8 PerfectInterpolantSequences, 369/521 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-11 06:13:06,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 278b4de367ce9a5d90b72b56db7b4bfd32cdd3486043ecd2959c1028ac507b6e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:13:08,321 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:13:08,394 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-11 06:13:08,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:13:08,399 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:13:08,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:13:08,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:13:08,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:13:08,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:13:08,440 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:13:08,442 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:13:08,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:13:08,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:13:08,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:13:08,444 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:13:08,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:13:08,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:13:08,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:13:08,445 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:13:08,446 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:13:08,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:13:08,446 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 06:13:08,447 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 06:13:08,447 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:13:08,447 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 06:13:08,448 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:13:08,448 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:13:08,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:13:08,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:13:08,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:13:08,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:13:08,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:13:08,450 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:13:08,450 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:13:08,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:13:08,451 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 06:13:08,451 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 06:13:08,451 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:13:08,451 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:13:08,452 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:13:08,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:13:08,455 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 06:13:08,455 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-clean/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-clean/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 -> 278b4de367ce9a5d90b72b56db7b4bfd32cdd3486043ecd2959c1028ac507b6e [2024-10-11 06:13:08,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:13:08,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:13:08,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:13:08,818 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:13:08,819 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:13:08,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c [2024-10-11 06:13:10,529 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:13:10,777 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:13:10,777 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c [2024-10-11 06:13:10,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/72e50848b/2ee1952609434a99a099b6efe5056887/FLAGfaaba4aec [2024-10-11 06:13:10,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/72e50848b/2ee1952609434a99a099b6efe5056887 [2024-10-11 06:13:10,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:13:10,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:13:10,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:13:10,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:13:10,824 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:13:10,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:13:10" (1/1) ... [2024-10-11 06:13:10,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38640c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:10, skipping insertion in model container [2024-10-11 06:13:10,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:13:10" (1/1) ... [2024-10-11 06:13:10,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:13:11,059 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.h_b04.c[1245,1258] [2024-10-11 06:13:11,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:13:11,129 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:13:11,144 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.h_b04.c[1245,1258] [2024-10-11 06:13:11,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:13:11,200 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:13:11,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:11 WrapperNode [2024-10-11 06:13:11,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:13:11,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:13:11,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:13:11,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:13:11,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:11" (1/1) ... [2024-10-11 06:13:11,220 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:11" (1/1) ... [2024-10-11 06:13:11,249 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 144 [2024-10-11 06:13:11,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:13:11,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:13:11,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:13:11,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:13:11,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:11" (1/1) ... [2024-10-11 06:13:11,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:11" (1/1) ... [2024-10-11 06:13:11,266 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:11" (1/1) ... [2024-10-11 06:13:11,281 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-11 06:13:11,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:11" (1/1) ... [2024-10-11 06:13:11,285 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:11" (1/1) ... [2024-10-11 06:13:11,295 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:11" (1/1) ... [2024-10-11 06:13:11,302 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:11" (1/1) ... [2024-10-11 06:13:11,303 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:11" (1/1) ... [2024-10-11 06:13:11,307 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:11" (1/1) ... [2024-10-11 06:13:11,309 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:13:11,312 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:13:11,312 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:13:11,312 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:13:11,313 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:11" (1/1) ... [2024-10-11 06:13:11,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:13:11,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:13:11,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 06:13:11,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 06:13:11,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:13:11,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 06:13:11,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 06:13:11,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:13:11,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:13:11,496 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:13:11,498 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:13:11,715 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-10-11 06:13:11,719 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:13:11,777 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:13:11,778 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:13:11,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:13:11 BoogieIcfgContainer [2024-10-11 06:13:11,779 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:13:11,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:13:11,782 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:13:11,785 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:13:11,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:13:10" (1/3) ... [2024-10-11 06:13:11,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75138c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:13:11, skipping insertion in model container [2024-10-11 06:13:11,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:11" (2/3) ... [2024-10-11 06:13:11,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75138c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:13:11, skipping insertion in model container [2024-10-11 06:13:11,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:13:11" (3/3) ... [2024-10-11 06:13:11,789 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b04.c [2024-10-11 06:13:11,808 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:13:11,808 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:13:11,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:13:11,882 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;@7c6d5ba5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:13:11,883 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:13:11,887 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-11 06:13:11,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 06:13:11,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:13:11,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 06:13:11,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:13:11,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:13:11,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 06:13:11,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:13:11,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732725542] [2024-10-11 06:13:11,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:13:11,918 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-11 06:13:11,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:13:11,922 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 06:13:11,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 06:13:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:13:12,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 06:13:12,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:13:12,345 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-11 06:13:12,346 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 06:13:12,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 06:13:12,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732725542] [2024-10-11 06:13:12,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732725542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:13:12,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:13:12,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 06:13:12,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436796884] [2024-10-11 06:13:12,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:13:12,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:13:12,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 06:13:12,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:13:12,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:13:12,384 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-11 06:13:12,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:13:12,441 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-11 06:13:12,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:13:12,445 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-11 06:13:12,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:13:12,452 INFO L225 Difference]: With dead ends: 15 [2024-10-11 06:13:12,453 INFO L226 Difference]: Without dead ends: 9 [2024-10-11 06:13:12,456 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-11 06:13:12,461 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-11 06:13:12,462 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-11 06:13:12,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-11 06:13:12,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-11 06:13:12,490 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-11 06:13:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 06:13:12,492 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 06:13:12,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:13:12,493 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 06:13:12,493 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-11 06:13:12,493 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 06:13:12,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 06:13:12,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:13:12,494 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 06:13:12,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 06:13:12,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 06:13:12,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:13:12,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:13:12,699 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 06:13:12,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:13:12,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275048509] [2024-10-11 06:13:12,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:13:12,700 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-11 06:13:12,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:13:12,703 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 06:13:12,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 06:13:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:13:12,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 06:13:12,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:13:13,051 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-11 06:13:13,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:13:13,383 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-11 06:13:13,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 06:13:13,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275048509] [2024-10-11 06:13:13,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275048509] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:13:13,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 06:13:13,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-11 06:13:13,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418891566] [2024-10-11 06:13:13,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 06:13:13,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 06:13:13,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 06:13:13,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 06:13:13,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:13:13,388 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-11 06:13:13,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:13:13,474 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-10-11 06:13:13,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:13:13,475 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-11 06:13:13,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:13:13,475 INFO L225 Difference]: With dead ends: 14 [2024-10-11 06:13:13,475 INFO L226 Difference]: Without dead ends: 12 [2024-10-11 06:13:13,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-11 06:13:13,477 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-11 06:13:13,477 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-11 06:13:13,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-11 06:13:13,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2024-10-11 06:13:13,483 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-11 06:13:13,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-11 06:13:13,484 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-11 06:13:13,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:13:13,484 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-11 06:13:13,484 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-11 06:13:13,484 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-11 06:13:13,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 06:13:13,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:13:13,485 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-11 06:13:13,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 06:13:13,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 06:13:13,687 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:13:13,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:13:13,687 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-11 06:13:13,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:13:13,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221741752] [2024-10-11 06:13:13,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 06:13:13,689 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-11 06:13:13,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:13:13,692 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 06:13:13,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 06:13:13,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 06:13:13,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 06:13:13,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 06:13:13,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:13:14,068 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-11 06:13:14,069 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:13:14,477 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-11 06:13:14,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 06:13:14,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221741752] [2024-10-11 06:13:14,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221741752] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:13:14,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 06:13:14,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-11 06:13:14,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085388994] [2024-10-11 06:13:14,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 06:13:14,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 06:13:14,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 06:13:14,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 06:13:14,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 06:13:14,481 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-11 06:13:14,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:13:14,654 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2024-10-11 06:13:14,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:13:14,655 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-11 06:13:14,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:13:14,655 INFO L225 Difference]: With dead ends: 12 [2024-10-11 06:13:14,655 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 06:13:14,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-10-11 06:13:14,657 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:13:14,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:13:14,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 06:13:14,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 06:13:14,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-11 06:13:14,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 06:13:14,660 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2024-10-11 06:13:14,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:13:14,660 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 06:13:14,660 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-11 06:13:14,660 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 06:13:14,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 06:13:14,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 06:13:14,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 06:13:14,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 06:13:14,868 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-10-11 06:13:14,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 06:13:14,910 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 06:13:14,932 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 06:13:14,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:13:14 BoogieIcfgContainer [2024-10-11 06:13:14,944 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 06:13:14,944 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 06:13:14,944 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 06:13:14,945 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 06:13:14,945 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:13:11" (3/4) ... [2024-10-11 06:13:14,947 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 06:13:14,968 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-11 06:13:14,969 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 06:13:14,969 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 06:13:14,970 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 06:13:14,970 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 06:13:15,115 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 06:13:15,116 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 06:13:15,116 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 06:13:15,116 INFO L158 Benchmark]: Toolchain (without parser) took 4300.39ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 38.1MB in the beginning and 79.6MB in the end (delta: -41.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:13:15,117 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 52.4MB. Free memory is still 29.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:13:15,117 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.67ms. Allocated memory is still 71.3MB. Free memory was 37.9MB in the beginning and 41.4MB in the end (delta: -3.5MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-10-11 06:13:15,117 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.20ms. Allocated memory is still 71.3MB. Free memory was 41.2MB in the beginning and 39.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 06:13:15,117 INFO L158 Benchmark]: Boogie Preprocessor took 58.98ms. Allocated memory is still 71.3MB. Free memory was 39.2MB in the beginning and 36.7MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 06:13:15,118 INFO L158 Benchmark]: RCFGBuilder took 466.86ms. Allocated memory is still 71.3MB. Free memory was 36.7MB in the beginning and 43.3MB in the end (delta: -6.6MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-10-11 06:13:15,118 INFO L158 Benchmark]: TraceAbstraction took 3162.02ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 42.6MB in the beginning and 84.8MB in the end (delta: -42.2MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2024-10-11 06:13:15,118 INFO L158 Benchmark]: Witness Printer took 171.50ms. Allocated memory is still 109.1MB. Free memory was 84.8MB in the beginning and 79.6MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 06:13:15,120 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.18ms. Allocated memory is still 52.4MB. Free memory is still 29.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.67ms. Allocated memory is still 71.3MB. Free memory was 37.9MB in the beginning and 41.4MB in the end (delta: -3.5MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.20ms. Allocated memory is still 71.3MB. Free memory was 41.2MB in the beginning and 39.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.98ms. Allocated memory is still 71.3MB. Free memory was 39.2MB in the beginning and 36.7MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 466.86ms. Allocated memory is still 71.3MB. Free memory was 36.7MB in the beginning and 43.3MB in the end (delta: -6.6MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3162.02ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 42.6MB in the beginning and 84.8MB in the end (delta: -42.2MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. * Witness Printer took 171.50ms. Allocated memory is still 109.1MB. Free memory was 84.8MB in the beginning and 79.6MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 4 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=2, InterpolantAutomatonStates: 18, 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, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 33 ConstructedInterpolants, 12 QuantifiedInterpolants, 840 SizeOfPredicates, 17 NumberOfNonLiveVariables, 261 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/18 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((1 == var_14) && (1 == mask_SORT_1)) RESULT: Ultimate proved your program to be correct! [2024-10-11 06:13:15,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 Writing output log to file Ultimate.log Result: TRUE