./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7383f54d0aefdd248f516d45c67549426beac87be78bf6e7bb8108aedb7974b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:19:56,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:19:56,753 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:19:56,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:19:56,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:19:56,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:19:56,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:19:56,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:19:56,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:19:56,798 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:19:56,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:19:56,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:19:56,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:19:56,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:19:56,802 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:19:56,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:19:56,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:19:56,803 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:19:56,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:19:56,804 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:19:56,804 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:19:56,804 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:19:56,805 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:19:56,805 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:19:56,805 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:19:56,806 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:19:56,806 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:19:56,806 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:19:56,806 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:19:56,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:19:56,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:19:56,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:19:56,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:19:56,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:19:56,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:19:56,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:19:56,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:19:56,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:19:56,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:19:56,810 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:19:56,810 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:19:56,810 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:19:56,811 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7383f54d0aefdd248f516d45c67549426beac87be78bf6e7bb8108aedb7974b [2024-10-11 02:19:57,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:19:57,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:19:57,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:19:57,079 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:19:57,079 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:19:57,080 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound1.c [2024-10-11 02:19:58,492 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:19:58,673 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:19:58,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound1.c [2024-10-11 02:19:58,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/db4683861/d3b7bf865b0d4eb6a519f8eb3b0f9d86/FLAGf9e6a8b29 [2024-10-11 02:19:58,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/db4683861/d3b7bf865b0d4eb6a519f8eb3b0f9d86 [2024-10-11 02:19:58,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:19:58,695 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:19:58,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:19:58,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:19:58,704 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:19:58,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:19:58" (1/1) ... [2024-10-11 02:19:58,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fcbdfb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:58, skipping insertion in model container [2024-10-11 02:19:58,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:19:58" (1/1) ... [2024-10-11 02:19:58,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:19:58,898 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound1.c[526,539] [2024-10-11 02:19:58,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:19:58,921 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:19:58,931 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound1.c[526,539] [2024-10-11 02:19:58,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:19:58,949 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:19:58,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:58 WrapperNode [2024-10-11 02:19:58,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:19:58,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:19:58,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:19:58,951 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:19:58,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:58" (1/1) ... [2024-10-11 02:19:58,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:58" (1/1) ... [2024-10-11 02:19:58,978 INFO L138 Inliner]: procedures = 14, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 69 [2024-10-11 02:19:58,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:19:58,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:19:58,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:19:58,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:19:58,990 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:58" (1/1) ... [2024-10-11 02:19:58,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:58" (1/1) ... [2024-10-11 02:19:58,992 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:58" (1/1) ... [2024-10-11 02:19:59,002 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-11 02:19:59,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:58" (1/1) ... [2024-10-11 02:19:59,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:58" (1/1) ... [2024-10-11 02:19:59,006 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:58" (1/1) ... [2024-10-11 02:19:59,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:58" (1/1) ... [2024-10-11 02:19:59,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:58" (1/1) ... [2024-10-11 02:19:59,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:58" (1/1) ... [2024-10-11 02:19:59,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:19:59,018 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:19:59,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:19:59,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:19:59,019 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:58" (1/1) ... [2024-10-11 02:19:59,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:19:59,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:19:59,059 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:19:59,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:19:59,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:19:59,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:19:59,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:19:59,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:19:59,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:19:59,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 02:19:59,108 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 02:19:59,177 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:19:59,181 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:19:59,389 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-11 02:19:59,389 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:19:59,427 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:19:59,436 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 02:19:59,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:19:59 BoogieIcfgContainer [2024-10-11 02:19:59,437 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:19:59,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:19:59,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:19:59,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:19:59,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:19:58" (1/3) ... [2024-10-11 02:19:59,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf63fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:19:59, skipping insertion in model container [2024-10-11 02:19:59,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:58" (2/3) ... [2024-10-11 02:19:59,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf63fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:19:59, skipping insertion in model container [2024-10-11 02:19:59,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:19:59" (3/3) ... [2024-10-11 02:19:59,448 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound1.c [2024-10-11 02:19:59,464 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:19:59,465 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:19:59,522 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:19:59,529 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;@70cb2c19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:19:59,529 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:19:59,533 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 02:19:59,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 02:19:59,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:19:59,539 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:19:59,539 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:19:59,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:19:59,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1291730102, now seen corresponding path program 1 times [2024-10-11 02:19:59,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:19:59,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963965962] [2024-10-11 02:19:59,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:19:59,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:19:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:19:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:19:59,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:19:59,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963965962] [2024-10-11 02:19:59,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963965962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:19:59,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:19:59,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 02:19:59,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155491635] [2024-10-11 02:19:59,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:19:59,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:19:59,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:19:59,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:19:59,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 02:19:59,715 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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-10-11 02:19:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:19:59,742 INFO L93 Difference]: Finished difference Result 45 states and 78 transitions. [2024-10-11 02:19:59,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:19:59,744 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-10-11 02:19:59,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:19:59,750 INFO L225 Difference]: With dead ends: 45 [2024-10-11 02:19:59,750 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 02:19:59,752 INFO L431 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-10-11 02:19:59,755 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:19:59,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:19:59,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 02:19:59,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-11 02:19:59,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 02:19:59,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2024-10-11 02:19:59,787 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 7 [2024-10-11 02:19:59,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:19:59,788 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2024-10-11 02:19:59,788 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-10-11 02:19:59,788 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2024-10-11 02:19:59,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 02:19:59,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:19:59,789 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:19:59,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:19:59,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:19:59,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:19:59,790 INFO L85 PathProgramCache]: Analyzing trace with hash 829671692, now seen corresponding path program 1 times [2024-10-11 02:19:59,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:19:59,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785986787] [2024-10-11 02:19:59,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:19:59,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:19:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:19:59,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:19:59,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:19:59,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785986787] [2024-10-11 02:19:59,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785986787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:19:59,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:19:59,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 02:19:59,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503605506] [2024-10-11 02:19:59,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:19:59,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:19:59,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:19:59,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:19:59,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:19:59,966 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 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-10-11 02:20:00,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:20:00,024 INFO L93 Difference]: Finished difference Result 35 states and 50 transitions. [2024-10-11 02:20:00,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:20:00,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 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-10-11 02:20:00,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:20:00,028 INFO L225 Difference]: With dead ends: 35 [2024-10-11 02:20:00,028 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 02:20:00,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:20:00,031 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:20:00,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 90 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:20:00,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 02:20:00,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2024-10-11 02:20:00,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 02:20:00,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2024-10-11 02:20:00,045 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 7 [2024-10-11 02:20:00,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:20:00,045 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2024-10-11 02:20:00,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 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-10-11 02:20:00,046 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2024-10-11 02:20:00,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 02:20:00,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:20:00,046 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:20:00,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:20:00,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:20:00,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:20:00,048 INFO L85 PathProgramCache]: Analyzing trace with hash -166824855, now seen corresponding path program 1 times [2024-10-11 02:20:00,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:20:00,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249004037] [2024-10-11 02:20:00,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:20:00,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:20:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:20:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:20:00,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:20:00,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249004037] [2024-10-11 02:20:00,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249004037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:20:00,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:20:00,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 02:20:00,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624495949] [2024-10-11 02:20:00,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:20:00,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 02:20:00,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:20:00,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 02:20:00,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 02:20:00,138 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-10-11 02:20:00,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:20:00,164 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2024-10-11 02:20:00,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 02:20:00,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2024-10-11 02:20:00,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:20:00,166 INFO L225 Difference]: With dead ends: 41 [2024-10-11 02:20:00,166 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 02:20:00,166 INFO L431 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-10-11 02:20:00,167 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:20:00,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:20:00,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 02:20:00,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-11 02:20:00,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 02:20:00,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-10-11 02:20:00,175 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 9 [2024-10-11 02:20:00,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:20:00,175 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-10-11 02:20:00,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-10-11 02:20:00,176 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2024-10-11 02:20:00,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 02:20:00,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:20:00,176 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:20:00,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:20:00,177 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:20:00,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:20:00,177 INFO L85 PathProgramCache]: Analyzing trace with hash -439138420, now seen corresponding path program 1 times [2024-10-11 02:20:00,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:20:00,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656759060] [2024-10-11 02:20:00,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:20:00,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:20:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:20:00,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 02:20:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:20:00,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:20:00,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:20:00,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656759060] [2024-10-11 02:20:00,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656759060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:20:00,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:20:00,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:20:00,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225462155] [2024-10-11 02:20:00,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:20:00,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:20:00,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:20:00,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:20:00,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:20:00,358 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-10-11 02:20:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:20:00,421 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2024-10-11 02:20:00,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:20:00,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 12 [2024-10-11 02:20:00,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:20:00,423 INFO L225 Difference]: With dead ends: 41 [2024-10-11 02:20:00,423 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 02:20:00,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:20:00,425 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:20:00,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 87 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:20:00,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 02:20:00,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2024-10-11 02:20:00,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 02:20:00,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-10-11 02:20:00,432 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 12 [2024-10-11 02:20:00,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:20:00,432 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-10-11 02:20:00,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-10-11 02:20:00,433 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-10-11 02:20:00,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 02:20:00,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:20:00,434 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:20:00,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:20:00,434 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:20:00,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:20:00,435 INFO L85 PathProgramCache]: Analyzing trace with hash -235147060, now seen corresponding path program 1 times [2024-10-11 02:20:00,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:20:00,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860082969] [2024-10-11 02:20:00,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:20:00,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:20:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:20:00,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1393792386] [2024-10-11 02:20:00,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:20:00,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:20:00,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:20:00,449 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:20:00,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:20:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:20:00,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 02:20:00,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:20:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:20:00,640 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:20:00,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:20:00,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860082969] [2024-10-11 02:20:00,641 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 02:20:00,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393792386] [2024-10-11 02:20:00,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393792386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:20:00,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:20:00,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:20:00,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931401630] [2024-10-11 02:20:00,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:20:00,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:20:00,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:20:00,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:20:00,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:20:00,644 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-10-11 02:20:00,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:20:00,729 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2024-10-11 02:20:00,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:20:00,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 17 [2024-10-11 02:20:00,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:20:00,731 INFO L225 Difference]: With dead ends: 60 [2024-10-11 02:20:00,731 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 02:20:00,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:20:00,733 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:20:00,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 91 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:20:00,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 02:20:00,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-11 02:20:00,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 02:20:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2024-10-11 02:20:00,746 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 17 [2024-10-11 02:20:00,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:20:00,746 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2024-10-11 02:20:00,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-10-11 02:20:00,746 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2024-10-11 02:20:00,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 02:20:00,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:20:00,748 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:20:00,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 02:20:00,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:20:00,949 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:20:00,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:20:00,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2012527405, now seen corresponding path program 1 times [2024-10-11 02:20:00,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:20:00,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358316723] [2024-10-11 02:20:00,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:20:00,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:20:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:20:01,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 02:20:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:20:01,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:20:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:20:01,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:20:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:20:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 02:20:01,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:20:01,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358316723] [2024-10-11 02:20:01,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358316723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:20:01,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:20:01,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:20:01,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141427351] [2024-10-11 02:20:01,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:20:01,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:20:01,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:20:01,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:20:01,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:20:01,103 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 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-10-11 02:20:01,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:20:01,166 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2024-10-11 02:20:01,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:20:01,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 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 25 [2024-10-11 02:20:01,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:20:01,168 INFO L225 Difference]: With dead ends: 59 [2024-10-11 02:20:01,170 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 02:20:01,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:20:01,171 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 15 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:20:01,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 49 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:20:01,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 02:20:01,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-11 02:20:01,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 26 states have internal predecessors, (28), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 02:20:01,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-10-11 02:20:01,182 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 25 [2024-10-11 02:20:01,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:20:01,182 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-10-11 02:20:01,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 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-10-11 02:20:01,183 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-10-11 02:20:01,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 02:20:01,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:20:01,184 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:20:01,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:20:01,184 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:20:01,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:20:01,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2010799527, now seen corresponding path program 1 times [2024-10-11 02:20:01,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:20:01,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749737470] [2024-10-11 02:20:01,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:20:01,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:20:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:20:01,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1136686778] [2024-10-11 02:20:01,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:20:01,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:20:01,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:20:01,200 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:20:01,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:20:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:20:01,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 02:20:01,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:20:01,349 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 02:20:01,349 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:20:01,528 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 02:20:01,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:20:01,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749737470] [2024-10-11 02:20:01,529 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 02:20:01,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136686778] [2024-10-11 02:20:01,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136686778] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:20:01,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 02:20:01,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-10-11 02:20:01,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613783076] [2024-10-11 02:20:01,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 02:20:01,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:20:01,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:20:01,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:20:01,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:20:01,531 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 02:20:01,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:20:01,612 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-10-11 02:20:01,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:20:01,615 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2024-10-11 02:20:01,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:20:01,616 INFO L225 Difference]: With dead ends: 44 [2024-10-11 02:20:01,616 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 02:20:01,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:20:01,617 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:20:01,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 64 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:20:01,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 02:20:01,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-11 02:20:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 02:20:01,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-10-11 02:20:01,634 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 25 [2024-10-11 02:20:01,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:20:01,634 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-10-11 02:20:01,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 02:20:01,635 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-10-11 02:20:01,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 02:20:01,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:20:01,636 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:20:01,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 02:20:01,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:20:01,837 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:20:01,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:20:01,837 INFO L85 PathProgramCache]: Analyzing trace with hash 2049051340, now seen corresponding path program 1 times [2024-10-11 02:20:01,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:20:01,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973775947] [2024-10-11 02:20:01,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:20:01,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:20:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:20:01,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [573057771] [2024-10-11 02:20:01,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:20:01,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:20:01,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:20:01,881 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:20:01,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 02:20:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 02:20:01,934 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 02:20:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 02:20:01,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 02:20:01,963 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 02:20:01,964 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 02:20:01,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 02:20:02,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:20:02,169 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:20:02,199 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 02:20:02,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:20:02 BoogieIcfgContainer [2024-10-11 02:20:02,202 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 02:20:02,202 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 02:20:02,202 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 02:20:02,202 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 02:20:02,203 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:19:59" (3/4) ... [2024-10-11 02:20:02,204 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 02:20:02,247 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 02:20:02,247 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 02:20:02,247 INFO L158 Benchmark]: Toolchain (without parser) took 3552.70ms. Allocated memory is still 176.2MB. Free memory was 122.5MB in the beginning and 135.2MB in the end (delta: -12.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 02:20:02,247 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 02:20:02,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.78ms. Allocated memory is still 176.2MB. Free memory was 122.5MB in the beginning and 109.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 02:20:02,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.64ms. Allocated memory is still 176.2MB. Free memory was 109.9MB in the beginning and 108.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 02:20:02,248 INFO L158 Benchmark]: Boogie Preprocessor took 38.08ms. Allocated memory is still 176.2MB. Free memory was 108.4MB in the beginning and 106.4MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 02:20:02,248 INFO L158 Benchmark]: RCFGBuilder took 418.48ms. Allocated memory is still 176.2MB. Free memory was 106.4MB in the beginning and 93.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 02:20:02,249 INFO L158 Benchmark]: TraceAbstraction took 2762.28ms. Allocated memory is still 176.2MB. Free memory was 93.1MB in the beginning and 137.3MB in the end (delta: -44.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 02:20:02,249 INFO L158 Benchmark]: Witness Printer took 44.85ms. Allocated memory is still 176.2MB. Free memory was 137.3MB in the beginning and 135.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 02:20:02,250 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.10ms. Allocated memory is still 176.2MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.78ms. Allocated memory is still 176.2MB. Free memory was 122.5MB in the beginning and 109.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.64ms. Allocated memory is still 176.2MB. Free memory was 109.9MB in the beginning and 108.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.08ms. Allocated memory is still 176.2MB. Free memory was 108.4MB in the beginning and 106.4MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 418.48ms. Allocated memory is still 176.2MB. Free memory was 106.4MB in the beginning and 93.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2762.28ms. Allocated memory is still 176.2MB. Free memory was 93.1MB in the beginning and 137.3MB in the end (delta: -44.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 44.85ms. Allocated memory is still 176.2MB. Free memory was 137.3MB in the beginning and 135.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] int A, B; [L25] int r, d, p, q; [L26] A = __VERIFIER_nondet_int() [L27] B = 1 [L29] r = A [L30] d = B [L31] p = 1 [L32] q = 0 VAL [A=1, B=1, counter=0, d=1, p=1, q=0, r=1] [L34] EXPR counter++ VAL [A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L34] COND TRUE counter++<1 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(q == 0) VAL [A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(r == A) VAL [A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(d == B * p) VAL [A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [A=1, B=1, counter=1, d=2, p=2, q=0, r=1] [L34] EXPR counter++ VAL [A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L34] COND FALSE !(counter++<1) [L44] EXPR counter++ VAL [A=1, B=1, counter=3, d=2, p=2, q=0, r=1] [L44] COND FALSE !(counter++<1) [L58] CALL __VERIFIER_assert(A == d*q + r) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L58] RET __VERIFIER_assert(A == d*q + r) VAL [A=1, B=1, counter=3, d=2, p=2, q=0, r=1] [L59] CALL __VERIFIER_assert(B == d) VAL [\old(cond)=0, counter=3] [L15] COND TRUE !(cond) VAL [\old(cond)=0, counter=3] [L17] reach_error() VAL [\old(cond)=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 67 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 494 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 328 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 215 IncrementalHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 166 mSDtfsCounter, 215 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=5, InterpolantAutomatonStates: 34, 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, 7 MinimizatonAttempts, 16 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 360 SizeOfPredicates, 3 NumberOfNonLiveVariables, 181 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 50/64 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 02:20:02,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE