./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4615816b63186e8ef25ffa56a09fb574b90534edb7a787dbb36e36eb2c34dee2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:24:30,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:24:30,319 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:24:30,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:24:30,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:24:30,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:24:30,357 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:24:30,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:24:30,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:24:30,358 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:24:30,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:24:30,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:24:30,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:24:30,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:24:30,362 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:24:30,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:24:30,362 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:24:30,363 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:24:30,363 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:24:30,363 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:24:30,363 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:24:30,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:24:30,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:24:30,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:24:30,368 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:24:30,369 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:24:30,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:24:30,369 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:24:30,370 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:24:30,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:24:30,370 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:24:30,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:24:30,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:24:30,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:24:30,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:24:30,372 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:24:30,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:24:30,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:24:30,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:24:30,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:24:30,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:24:30,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:24:30,374 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4615816b63186e8ef25ffa56a09fb574b90534edb7a787dbb36e36eb2c34dee2 [2024-11-11 20:24:30,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:24:30,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:24:30,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:24:30,679 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:24:30,680 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:24:30,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound10.c [2024-11-11 20:24:32,048 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:24:32,224 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:24:32,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound10.c [2024-11-11 20:24:32,232 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf3cf1c96/e612cba05138413d94f6b8056489fd98/FLAG99cfe548d [2024-11-11 20:24:32,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf3cf1c96/e612cba05138413d94f6b8056489fd98 [2024-11-11 20:24:32,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:24:32,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:24:32,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:24:32,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:24:32,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:24:32,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:24:32" (1/1) ... [2024-11-11 20:24:32,639 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a6e3ad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:24:32, skipping insertion in model container [2024-11-11 20:24:32,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:24:32" (1/1) ... [2024-11-11 20:24:32,657 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:24:32,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound10.c[520,533] [2024-11-11 20:24:32,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:24:32,906 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:24:32,921 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound10.c[520,533] [2024-11-11 20:24:32,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:24:32,950 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:24:32,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:24:32 WrapperNode [2024-11-11 20:24:32,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:24:32,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:24:32,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:24:32,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:24:32,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:24:32" (1/1) ... [2024-11-11 20:24:32,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:24:32" (1/1) ... [2024-11-11 20:24:32,983 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2024-11-11 20:24:32,984 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:24:32,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:24:32,985 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:24:32,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:24:32,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:24:32" (1/1) ... [2024-11-11 20:24:32,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:24:32" (1/1) ... [2024-11-11 20:24:32,995 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:24:32" (1/1) ... [2024-11-11 20:24:33,010 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 20:24:33,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:24:32" (1/1) ... [2024-11-11 20:24:33,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:24:32" (1/1) ... [2024-11-11 20:24:33,015 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:24:32" (1/1) ... [2024-11-11 20:24:33,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:24:32" (1/1) ... [2024-11-11 20:24:33,022 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:24:32" (1/1) ... [2024-11-11 20:24:33,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:24:32" (1/1) ... [2024-11-11 20:24:33,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:24:33,027 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:24:33,028 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:24:33,028 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:24:33,029 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:24:32" (1/1) ... [2024-11-11 20:24:33,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:24:33,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:24:33,061 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 20:24:33,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 20:24:33,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:24:33,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:24:33,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:24:33,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:24:33,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-11 20:24:33,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-11 20:24:33,179 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:24:33,181 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:24:33,325 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-11 20:24:33,326 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:24:33,337 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:24:33,337 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:24:33,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:24:33 BoogieIcfgContainer [2024-11-11 20:24:33,338 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:24:33,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:24:33,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:24:33,344 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:24:33,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:24:32" (1/3) ... [2024-11-11 20:24:33,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388e23db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:24:33, skipping insertion in model container [2024-11-11 20:24:33,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:24:32" (2/3) ... [2024-11-11 20:24:33,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388e23db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:24:33, skipping insertion in model container [2024-11-11 20:24:33,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:24:33" (3/3) ... [2024-11-11 20:24:33,347 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound10.c [2024-11-11 20:24:33,367 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:24:33,367 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:24:33,421 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:24:33,427 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;@1da689ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:24:33,428 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:24:33,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 20:24:33,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-11 20:24:33,439 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:24:33,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:24:33,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:24:33,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:24:33,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1821846948, now seen corresponding path program 1 times [2024-11-11 20:24:33,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:24:33,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638879893] [2024-11-11 20:24:33,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:24:33,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:24:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:24:33,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-11-11 20:24:33,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:24:33,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638879893] [2024-11-11 20:24:33,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638879893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:24:33,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:24:33,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:24:33,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770577315] [2024-11-11 20:24:33,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:24:33,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:24:33,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:24:33,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:24:33,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:24:33,650 INFO L87 Difference]: Start difference. First operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:24:33,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:24:33,670 INFO L93 Difference]: Finished difference Result 40 states and 62 transitions. [2024-11-11 20:24:33,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:24:33,672 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-11 20:24:33,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:24:33,678 INFO L225 Difference]: With dead ends: 40 [2024-11-11 20:24:33,678 INFO L226 Difference]: Without dead ends: 17 [2024-11-11 20:24:33,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:24:33,685 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:24:33,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:24:33,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-11 20:24:33,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-11 20:24:33,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-11 20:24:33,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2024-11-11 20:24:33,723 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 7 [2024-11-11 20:24:33,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:24:33,724 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2024-11-11 20:24:33,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:24:33,724 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2024-11-11 20:24:33,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-11 20:24:33,725 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:24:33,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:24:33,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:24:33,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:24:33,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:24:33,727 INFO L85 PathProgramCache]: Analyzing trace with hash 178653015, now seen corresponding path program 1 times [2024-11-11 20:24:33,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:24:33,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589192565] [2024-11-11 20:24:33,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:24:33,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:24:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:24:33,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:24:33,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:24:33,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589192565] [2024-11-11 20:24:33,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589192565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:24:33,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:24:33,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:24:33,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398775031] [2024-11-11 20:24:33,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:24:33,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 20:24:33,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:24:33,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 20:24:33,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 20:24:33,824 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:24:33,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:24:33,856 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2024-11-11 20:24:33,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 20:24:33,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-11 20:24:33,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:24:33,858 INFO L225 Difference]: With dead ends: 28 [2024-11-11 20:24:33,858 INFO L226 Difference]: Without dead ends: 19 [2024-11-11 20:24:33,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 20:24:33,860 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:24:33,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:24:33,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-11 20:24:33,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-11 20:24:33,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-11 20:24:33,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2024-11-11 20:24:33,869 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 8 [2024-11-11 20:24:33,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:24:33,870 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-11-11 20:24:33,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:24:33,870 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2024-11-11 20:24:33,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-11 20:24:33,871 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:24:33,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:24:33,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:24:33,871 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:24:33,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:24:33,872 INFO L85 PathProgramCache]: Analyzing trace with hash 180321311, now seen corresponding path program 1 times [2024-11-11 20:24:33,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:24:33,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329164488] [2024-11-11 20:24:33,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:24:33,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:24:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:24:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:24:34,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:24:34,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329164488] [2024-11-11 20:24:34,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329164488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:24:34,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:24:34,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:24:34,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943890284] [2024-11-11 20:24:34,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:24:34,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:24:34,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:24:34,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:24:34,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:24:34,047 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:24:34,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:24:34,117 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2024-11-11 20:24:34,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:24:34,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-11 20:24:34,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:24:34,119 INFO L225 Difference]: With dead ends: 32 [2024-11-11 20:24:34,119 INFO L226 Difference]: Without dead ends: 30 [2024-11-11 20:24:34,120 INFO L434 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-11-11 20:24:34,121 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:24:34,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 67 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:24:34,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-11 20:24:34,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-11-11 20:24:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-11 20:24:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-11-11 20:24:34,142 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 8 [2024-11-11 20:24:34,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:24:34,143 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-11-11 20:24:34,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:24:34,143 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-11-11 20:24:34,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-11 20:24:34,144 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:24:34,144 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:24:34,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:24:34,144 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:24:34,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:24:34,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1242689983, now seen corresponding path program 1 times [2024-11-11 20:24:34,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:24:34,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010032218] [2024-11-11 20:24:34,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:24:34,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:24:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 20:24:34,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [830757837] [2024-11-11 20:24:34,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:24:34,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:24:34,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:24:34,180 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:24:34,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 20:24:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:24:34,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 20:24:34,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:24:34,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:24:34,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:24:34,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:24:34,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010032218] [2024-11-11 20:24:34,359 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 20:24:34,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830757837] [2024-11-11 20:24:34,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830757837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:24:34,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:24:34,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:24:34,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976988683] [2024-11-11 20:24:34,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:24:34,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:24:34,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:24:34,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:24:34,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:24:34,363 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:24:34,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:24:34,423 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2024-11-11 20:24:34,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:24:34,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-11 20:24:34,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:24:34,425 INFO L225 Difference]: With dead ends: 36 [2024-11-11 20:24:34,425 INFO L226 Difference]: Without dead ends: 34 [2024-11-11 20:24:34,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-11 20:24:34,426 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:24:34,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 70 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:24:34,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-11 20:24:34,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-11 20:24:34,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-11 20:24:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-11-11 20:24:34,437 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 13 [2024-11-11 20:24:34,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:24:34,437 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-11 20:24:34,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:24:34,438 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-11-11 20:24:34,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-11 20:24:34,439 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:24:34,439 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:24:34,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 20:24:34,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:24:34,643 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:24:34,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:24:34,644 INFO L85 PathProgramCache]: Analyzing trace with hash 892115231, now seen corresponding path program 1 times [2024-11-11 20:24:34,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:24:34,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302726645] [2024-11-11 20:24:34,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:24:34,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:24:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 20:24:34,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1061745007] [2024-11-11 20:24:34,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:24:34,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:24:34,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:24:34,663 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:24:34,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 20:24:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:24:34,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 20:24:34,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:24:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 20:24:34,778 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:24:34,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:24:34,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302726645] [2024-11-11 20:24:34,779 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 20:24:34,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061745007] [2024-11-11 20:24:34,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061745007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:24:34,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:24:34,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:24:34,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876231890] [2024-11-11 20:24:34,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:24:34,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:24:34,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:24:34,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:24:34,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:24:34,781 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:24:34,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:24:34,854 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2024-11-11 20:24:34,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:24:34,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-11-11 20:24:34,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:24:34,859 INFO L225 Difference]: With dead ends: 40 [2024-11-11 20:24:34,859 INFO L226 Difference]: Without dead ends: 35 [2024-11-11 20:24:34,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-11-11 20:24:34,860 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:24:34,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 85 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:24:34,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-11 20:24:34,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-11 20:24:34,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-11 20:24:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-11-11 20:24:34,872 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 18 [2024-11-11 20:24:34,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:24:34,877 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-11 20:24:34,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:24:34,878 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-11-11 20:24:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-11 20:24:34,878 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:24:34,878 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:24:34,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 20:24:35,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:24:35,080 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:24:35,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:24:35,081 INFO L85 PathProgramCache]: Analyzing trace with hash 259746456, now seen corresponding path program 1 times [2024-11-11 20:24:35,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:24:35,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624814950] [2024-11-11 20:24:35,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:24:35,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:24:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:24:35,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 20:24:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:24:35,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:24:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:24:35,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:24:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:24:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:24:35,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:24:35,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624814950] [2024-11-11 20:24:35,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624814950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:24:35,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908487590] [2024-11-11 20:24:35,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:24:35,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:24:35,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:24:35,227 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:24:35,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 20:24:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:24:35,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 20:24:35,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:24:35,345 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:24:35,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:24:35,414 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:24:35,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908487590] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:24:35,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:24:35,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2024-11-11 20:24:35,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862814872] [2024-11-11 20:24:35,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:24:35,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:24:35,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:24:35,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:24:35,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:24:35,417 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-11 20:24:35,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:24:35,548 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2024-11-11 20:24:35,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:24:35,550 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 26 [2024-11-11 20:24:35,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:24:35,551 INFO L225 Difference]: With dead ends: 76 [2024-11-11 20:24:35,551 INFO L226 Difference]: Without dead ends: 67 [2024-11-11 20:24:35,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:24:35,552 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 33 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:24:35,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 98 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:24:35,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-11 20:24:35,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2024-11-11 20:24:35,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.2) internal successors, (42), 38 states have internal predecessors, (42), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-11 20:24:35,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2024-11-11 20:24:35,584 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 81 transitions. Word has length 26 [2024-11-11 20:24:35,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:24:35,585 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 81 transitions. [2024-11-11 20:24:35,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-11 20:24:35,585 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2024-11-11 20:24:35,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-11 20:24:35,586 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:24:35,586 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:24:35,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 20:24:35,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:24:35,793 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:24:35,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:24:35,793 INFO L85 PathProgramCache]: Analyzing trace with hash 261414752, now seen corresponding path program 1 times [2024-11-11 20:24:35,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:24:35,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978494408] [2024-11-11 20:24:35,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:24:35,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:24:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:24:35,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 20:24:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:24:35,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:24:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:24:35,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:24:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:24:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:24:35,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:24:35,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978494408] [2024-11-11 20:24:35,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978494408] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:24:35,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860057354] [2024-11-11 20:24:35,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:24:35,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:24:35,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:24:35,980 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:24:35,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 20:24:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:24:36,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-11 20:24:36,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:24:36,110 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:24:36,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:24:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 20:24:36,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860057354] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 20:24:36,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-11 20:24:36,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 9 [2024-11-11 20:24:36,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887939760] [2024-11-11 20:24:36,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:24:36,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:24:36,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:24:36,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:24:36,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:24:36,191 INFO L87 Difference]: Start difference. First operand 63 states and 81 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 20:24:36,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:24:36,236 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2024-11-11 20:24:36,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:24:36,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2024-11-11 20:24:36,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:24:36,238 INFO L225 Difference]: With dead ends: 77 [2024-11-11 20:24:36,238 INFO L226 Difference]: Without dead ends: 75 [2024-11-11 20:24:36,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:24:36,239 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:24:36,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 58 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:24:36,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-11 20:24:36,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-11 20:24:36,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 47 states have internal predecessors, (51), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-11 20:24:36,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2024-11-11 20:24:36,264 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 26 [2024-11-11 20:24:36,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:24:36,265 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2024-11-11 20:24:36,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 20:24:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2024-11-11 20:24:36,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-11 20:24:36,266 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:24:36,267 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:24:36,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 20:24:36,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:24:36,469 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:24:36,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:24:36,469 INFO L85 PathProgramCache]: Analyzing trace with hash -857109600, now seen corresponding path program 2 times [2024-11-11 20:24:36,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:24:36,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623758718] [2024-11-11 20:24:36,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:24:36,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:24:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 20:24:36,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1862338907] [2024-11-11 20:24:36,483 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 20:24:36,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:24:36,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:24:36,485 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:24:36,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 20:24:36,541 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 20:24:36,541 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 20:24:36,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-11 20:24:36,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:24:36,690 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 20:24:36,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:24:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:24:36,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:24:36,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623758718] [2024-11-11 20:24:36,894 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 20:24:36,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862338907] [2024-11-11 20:24:36,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862338907] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:24:36,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 20:24:36,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2024-11-11 20:24:36,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730909811] [2024-11-11 20:24:36,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 20:24:36,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 20:24:36,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:24:36,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 20:24:36,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:24:36,898 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 20:24:37,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:24:37,063 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2024-11-11 20:24:37,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:24:37,064 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 31 [2024-11-11 20:24:37,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:24:37,066 INFO L225 Difference]: With dead ends: 86 [2024-11-11 20:24:37,066 INFO L226 Difference]: Without dead ends: 81 [2024-11-11 20:24:37,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:24:37,067 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:24:37,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 97 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:24:37,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-11 20:24:37,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2024-11-11 20:24:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.1) internal successors, (55), 52 states have internal predecessors, (55), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-11 20:24:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2024-11-11 20:24:37,096 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 31 [2024-11-11 20:24:37,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:24:37,096 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2024-11-11 20:24:37,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 20:24:37,097 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2024-11-11 20:24:37,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 20:24:37,098 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:24:37,098 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2024-11-11 20:24:37,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-11 20:24:37,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:24:37,305 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:24:37,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:24:37,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1192261919, now seen corresponding path program 3 times [2024-11-11 20:24:37,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:24:37,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200027677] [2024-11-11 20:24:37,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:24:37,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:24:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 20:24:37,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1826540731] [2024-11-11 20:24:37,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 20:24:37,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:24:37,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:24:37,329 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:24:37,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 20:24:37,380 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-11 20:24:37,380 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 20:24:37,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-11 20:24:37,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:24:37,569 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 20 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-11 20:24:37,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:24:38,033 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 37 proven. 4 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-11 20:24:38,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:24:38,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200027677] [2024-11-11 20:24:38,034 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 20:24:38,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826540731] [2024-11-11 20:24:38,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826540731] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:24:38,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 20:24:38,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2024-11-11 20:24:38,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647059108] [2024-11-11 20:24:38,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 20:24:38,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 20:24:38,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:24:38,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 20:24:38,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:24:38,037 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 14 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-11 20:24:38,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:24:38,199 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2024-11-11 20:24:38,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:24:38,200 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) Word has length 54 [2024-11-11 20:24:38,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:24:38,200 INFO L225 Difference]: With dead ends: 80 [2024-11-11 20:24:38,200 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 20:24:38,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:24:38,202 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:24:38,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 157 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:24:38,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 20:24:38,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 20:24:38,202 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-11-11 20:24:38,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 20:24:38,203 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2024-11-11 20:24:38,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:24:38,203 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 20:24:38,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-11 20:24:38,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 20:24:38,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 20:24:38,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 20:24:38,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-11 20:24:38,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:24:38,417 INFO L421 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2024-11-11 20:24:38,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 20:24:38,988 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 20:24:39,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 08:24:39 BoogieIcfgContainer [2024-11-11 20:24:39,008 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 20:24:39,009 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 20:24:39,009 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 20:24:39,009 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 20:24:39,009 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:24:33" (3/4) ... [2024-11-11 20:24:39,011 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 20:24:39,015 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-11 20:24:39,020 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-11 20:24:39,021 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 20:24:39,021 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 20:24:39,021 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:24:39,114 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 20:24:39,115 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 20:24:39,115 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 20:24:39,116 INFO L158 Benchmark]: Toolchain (without parser) took 6483.83ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 82.5MB in the beginning and 139.4MB in the end (delta: -56.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 20:24:39,116 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 151.0MB. Free memory was 118.8MB in the beginning and 118.8MB in the end (delta: 27.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 20:24:39,116 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.79ms. Allocated memory is still 151.0MB. Free memory was 82.1MB in the beginning and 119.7MB in the end (delta: -37.5MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-11-11 20:24:39,116 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.53ms. Allocated memory is still 151.0MB. Free memory was 119.7MB in the beginning and 118.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 20:24:39,117 INFO L158 Benchmark]: Boogie Preprocessor took 41.77ms. Allocated memory is still 151.0MB. Free memory was 118.1MB in the beginning and 116.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:24:39,117 INFO L158 Benchmark]: RCFGBuilder took 311.30ms. Allocated memory is still 151.0MB. Free memory was 116.5MB in the beginning and 106.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 20:24:39,117 INFO L158 Benchmark]: TraceAbstraction took 5668.00ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 105.0MB in the beginning and 144.7MB in the end (delta: -39.7MB). Peak memory consumption was 91.2MB. Max. memory is 16.1GB. [2024-11-11 20:24:39,117 INFO L158 Benchmark]: Witness Printer took 106.61ms. Allocated memory is still 182.5MB. Free memory was 144.7MB in the beginning and 139.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 20:24:39,123 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.22ms. Allocated memory is still 151.0MB. Free memory was 118.8MB in the beginning and 118.8MB in the end (delta: 27.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.79ms. Allocated memory is still 151.0MB. Free memory was 82.1MB in the beginning and 119.7MB in the end (delta: -37.5MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.53ms. Allocated memory is still 151.0MB. Free memory was 119.7MB in the beginning and 118.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.77ms. Allocated memory is still 151.0MB. Free memory was 118.1MB in the beginning and 116.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 311.30ms. Allocated memory is still 151.0MB. Free memory was 116.5MB in the beginning and 106.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5668.00ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 105.0MB in the beginning and 144.7MB in the end (delta: -39.7MB). Peak memory consumption was 91.2MB. Max. memory is 16.1GB. * Witness Printer took 106.61ms. Allocated memory is still 182.5MB. Free memory was 144.7MB in the beginning and 139.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 14]: 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 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 9, TraceHistogramMax: 9, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 104 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 718 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 528 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 398 IncrementalHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 190 mSDtfsCounter, 398 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 336 GetRequests, 277 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=8, InterpolantAutomatonStates: 56, 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, 9 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 359 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 365 ConstructedInterpolants, 0 QuantifiedInterpolants, 1500 SizeOfPredicates, 8 NumberOfNonLiveVariables, 492 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 451/493 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: 30]: Loop Invariant Derived loop invariant: ((t == (1 + ((__int128) 2 * a))) && (((__int128) s * 4) == ((((__int128) t * t) + ((__int128) 2 * t)) + 1))) - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: ((cond != 0) && (counter == \old(counter))) RESULT: Ultimate proved your program to be correct! [2024-11-11 20:24:39,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE