./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_length_check-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_length_check-2.i -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 0b1cf2dd5b4da09460afcca66f285dbd0591f4fa3369eb070fcfcc2c1d99d315 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:10:43,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:10:43,920 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:10:43,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:10:43,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:10:43,961 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:10:43,962 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:10:43,963 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:10:43,963 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:10:43,964 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:10:43,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:10:43,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:10:43,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:10:43,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:10:43,966 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:10:43,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:10:43,967 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:10:43,968 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:10:43,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:10:43,968 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:10:43,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:10:43,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:10:43,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:10:43,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:10:43,971 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:10:43,971 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:10:43,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:10:43,971 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:10:43,972 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:10:43,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:10:43,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:10:43,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:10:43,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:10:43,972 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:10:43,972 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:10:43,972 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:10:43,973 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:10:43,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:10:43,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:10:43,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:10:43,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:10:43,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:10:43,975 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 -> 0b1cf2dd5b4da09460afcca66f285dbd0591f4fa3369eb070fcfcc2c1d99d315 [2024-11-09 22:10:44,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:10:44,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:10:44,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:10:44,162 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:10:44,162 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:10:44,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_length_check-2.i [2024-11-09 22:10:45,302 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:10:45,479 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:10:45,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_length_check-2.i [2024-11-09 22:10:45,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43ef1d9bb/e9388a92cd6841dbb4926d9561c22ce3/FLAG7547bec72 [2024-11-09 22:10:45,499 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43ef1d9bb/e9388a92cd6841dbb4926d9561c22ce3 [2024-11-09 22:10:45,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:10:45,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:10:45,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:10:45,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:10:45,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:10:45,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:10:45" (1/1) ... [2024-11-09 22:10:45,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b0b0d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:45, skipping insertion in model container [2024-11-09 22:10:45,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:10:45" (1/1) ... [2024-11-09 22:10:45,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:10:45,785 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/list-ext3-properties/sll_length_check-2.i[23814,23827] [2024-11-09 22:10:45,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:10:45,795 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:10:45,834 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/list-ext3-properties/sll_length_check-2.i[23814,23827] [2024-11-09 22:10:45,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:10:45,859 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:10:45,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:45 WrapperNode [2024-11-09 22:10:45,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:10:45,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:10:45,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:10:45,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:10:45,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:45" (1/1) ... [2024-11-09 22:10:45,877 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:45" (1/1) ... [2024-11-09 22:10:45,890 INFO L138 Inliner]: procedures = 125, calls = 15, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 85 [2024-11-09 22:10:45,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:10:45,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:10:45,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:10:45,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:10:45,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:45" (1/1) ... [2024-11-09 22:10:45,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:45" (1/1) ... [2024-11-09 22:10:45,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:45" (1/1) ... [2024-11-09 22:10:45,912 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-09 22:10:45,912 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:45" (1/1) ... [2024-11-09 22:10:45,912 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:45" (1/1) ... [2024-11-09 22:10:45,920 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:45" (1/1) ... [2024-11-09 22:10:45,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:45" (1/1) ... [2024-11-09 22:10:45,921 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:45" (1/1) ... [2024-11-09 22:10:45,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:45" (1/1) ... [2024-11-09 22:10:45,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:10:45,928 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:10:45,928 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:10:45,928 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:10:45,929 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:45" (1/1) ... [2024-11-09 22:10:45,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:10:45,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:10:45,954 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-09 22:10:45,956 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-09 22:10:45,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 22:10:45,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:10:45,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 22:10:45,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 22:10:45,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 22:10:45,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 22:10:45,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 22:10:45,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:10:45,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 22:10:45,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:10:45,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:10:46,092 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:10:46,094 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:10:46,177 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: assume true;havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2024-11-09 22:10:46,188 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-09 22:10:46,189 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:10:46,197 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:10:46,197 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:10:46,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:10:46 BoogieIcfgContainer [2024-11-09 22:10:46,198 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:10:46,199 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:10:46,200 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:10:46,202 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:10:46,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:10:45" (1/3) ... [2024-11-09 22:10:46,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9736d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:10:46, skipping insertion in model container [2024-11-09 22:10:46,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:45" (2/3) ... [2024-11-09 22:10:46,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9736d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:10:46, skipping insertion in model container [2024-11-09 22:10:46,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:10:46" (3/3) ... [2024-11-09 22:10:46,204 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_length_check-2.i [2024-11-09 22:10:46,216 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:10:46,217 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:10:46,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:10:46,260 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;@37b6c682, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:10:46,261 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:10:46,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:10:46,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 22:10:46,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:10:46,269 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:10:46,270 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:10:46,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:10:46,275 INFO L85 PathProgramCache]: Analyzing trace with hash -49745978, now seen corresponding path program 1 times [2024-11-09 22:10:46,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:10:46,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930492790] [2024-11-09 22:10:46,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:46,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:10:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:46,414 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-09 22:10:46,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:10:46,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930492790] [2024-11-09 22:10:46,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930492790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:10:46,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:10:46,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 22:10:46,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352435633] [2024-11-09 22:10:46,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:10:46,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 22:10:46,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:10:46,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 22:10:46,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:10:46,444 INFO L87 Difference]: Start difference. First operand has 28 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:10:46,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:10:46,472 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2024-11-09 22:10:46,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 22:10:46,478 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 22:10:46,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:10:46,487 INFO L225 Difference]: With dead ends: 50 [2024-11-09 22:10:46,491 INFO L226 Difference]: Without dead ends: 20 [2024-11-09 22:10:46,493 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-11-09 22:10:46,495 INFO L432 NwaCegarLoop]: 32 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, 32 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-09 22:10:46,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:10:46,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-09 22:10:46,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-09 22:10:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:10:46,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-09 22:10:46,531 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2024-11-09 22:10:46,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:10:46,531 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-09 22:10:46,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:10:46,531 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-11-09 22:10:46,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 22:10:46,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:10:46,532 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:10:46,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:10:46,532 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:10:46,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:10:46,533 INFO L85 PathProgramCache]: Analyzing trace with hash -944963075, now seen corresponding path program 1 times [2024-11-09 22:10:46,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:10:46,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280594689] [2024-11-09 22:10:46,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:46,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:10:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:46,684 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-09 22:10:46,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:10:46,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280594689] [2024-11-09 22:10:46,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280594689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:10:46,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:10:46,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:10:46,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249471328] [2024-11-09 22:10:46,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:10:46,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:10:46,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:10:46,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:10:46,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:10:46,689 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:10:46,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:10:46,741 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2024-11-09 22:10:46,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:10:46,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 22:10:46,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:10:46,743 INFO L225 Difference]: With dead ends: 49 [2024-11-09 22:10:46,743 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 22:10:46,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:10:46,744 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:10:46,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 68 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:10:46,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 22:10:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2024-11-09 22:10:46,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-09 22:10:46,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-09 22:10:46,751 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2024-11-09 22:10:46,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:10:46,751 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-09 22:10:46,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:10:46,751 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-11-09 22:10:46,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 22:10:46,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:10:46,752 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:10:46,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:10:46,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:10:46,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:10:46,754 INFO L85 PathProgramCache]: Analyzing trace with hash 874828012, now seen corresponding path program 1 times [2024-11-09 22:10:46,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:10:46,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475144926] [2024-11-09 22:10:46,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:46,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:10:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:46,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:10:46,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:10:46,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475144926] [2024-11-09 22:10:46,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475144926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:46,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371973654] [2024-11-09 22:10:46,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:46,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:46,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:10:46,865 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-09 22:10:46,866 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-09 22:10:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:46,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 22:10:46,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:10:46,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:10:46,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:10:46,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371973654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:10:46,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 22:10:46,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-11-09 22:10:46,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741909536] [2024-11-09 22:10:46,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:10:46,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:10:46,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:10:46,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:10:46,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:10:46,999 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:10:47,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:10:47,041 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2024-11-09 22:10:47,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:10:47,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 22:10:47,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:10:47,044 INFO L225 Difference]: With dead ends: 51 [2024-11-09 22:10:47,044 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 22:10:47,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:10:47,048 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 35 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:10:47,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 76 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:10:47,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 22:10:47,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 22. [2024-11-09 22:10:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:10:47,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-09 22:10:47,054 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 20 [2024-11-09 22:10:47,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:10:47,054 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-09 22:10:47,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:10:47,054 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-09 22:10:47,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 22:10:47,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:10:47,055 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:10:47,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 22:10:47,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:47,256 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:10:47,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:10:47,257 INFO L85 PathProgramCache]: Analyzing trace with hash -825690653, now seen corresponding path program 1 times [2024-11-09 22:10:47,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:10:47,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81278976] [2024-11-09 22:10:47,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:47,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:10:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:47,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:10:47,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:10:47,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81278976] [2024-11-09 22:10:47,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81278976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:47,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739208748] [2024-11-09 22:10:47,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:47,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:47,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:10:47,338 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-09 22:10:47,342 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-09 22:10:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:47,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 22:10:47,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:10:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:10:47,443 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:10:47,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:10:47,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739208748] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:10:47,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:10:47,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-09 22:10:47,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911233762] [2024-11-09 22:10:47,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:10:47,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:10:47,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:10:47,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:10:47,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:10:47,483 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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-09 22:10:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:10:47,542 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2024-11-09 22:10:47,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 22:10:47,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 22:10:47,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:10:47,543 INFO L225 Difference]: With dead ends: 57 [2024-11-09 22:10:47,543 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 22:10:47,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:10:47,544 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 44 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:10:47,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 67 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:10:47,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 22:10:47,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2024-11-09 22:10:47,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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-09 22:10:47,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-11-09 22:10:47,548 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 21 [2024-11-09 22:10:47,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:10:47,548 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-11-09 22:10:47,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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-09 22:10:47,548 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-09 22:10:47,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 22:10:47,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:10:47,549 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:10:47,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 22:10:47,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-09 22:10:47,750 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:10:47,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:10:47,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1029473993, now seen corresponding path program 2 times [2024-11-09 22:10:47,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:10:47,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029323777] [2024-11-09 22:10:47,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:47,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:10:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:47,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 22:10:47,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:10:47,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029323777] [2024-11-09 22:10:47,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029323777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:10:47,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:10:47,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 22:10:47,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469088662] [2024-11-09 22:10:47,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:10:47,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 22:10:47,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:10:47,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 22:10:47,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:10:47,820 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:10:47,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:10:47,845 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2024-11-09 22:10:47,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 22:10:47,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 22:10:47,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:10:47,846 INFO L225 Difference]: With dead ends: 34 [2024-11-09 22:10:47,846 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 22:10:47,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:10:47,847 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:10:47,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 90 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:10:47,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 22:10:47,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-09 22:10:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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-09 22:10:47,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-11-09 22:10:47,853 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 25 [2024-11-09 22:10:47,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:10:47,854 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-09 22:10:47,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:10:47,855 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-11-09 22:10:47,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 22:10:47,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:10:47,855 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:10:47,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 22:10:47,855 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:10:47,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:10:47,856 INFO L85 PathProgramCache]: Analyzing trace with hash 934796650, now seen corresponding path program 1 times [2024-11-09 22:10:47,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:10:47,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492668392] [2024-11-09 22:10:47,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:47,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:10:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:48,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:10:48,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:10:48,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492668392] [2024-11-09 22:10:48,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492668392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:48,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647353846] [2024-11-09 22:10:48,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:48,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:48,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:10:48,062 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-09 22:10:48,063 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-09 22:10:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:48,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 22:10:48,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:10:48,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 22:10:48,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-09 22:10:48,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:10:48,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:10:48,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:10:48,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647353846] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:10:48,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:10:48,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 12 [2024-11-09 22:10:48,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314232919] [2024-11-09 22:10:48,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:10:48,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 22:10:48,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:10:48,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 22:10:48,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 22:10:48,264 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 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-09 22:10:48,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:10:48,324 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-11-09 22:10:48,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 22:10:48,324 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 22:10:48,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:10:48,325 INFO L225 Difference]: With dead ends: 38 [2024-11-09 22:10:48,325 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 22:10:48,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-09 22:10:48,325 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:10:48,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 143 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:10:48,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 22:10:48,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-09 22:10:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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-09 22:10:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-09 22:10:48,330 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 27 [2024-11-09 22:10:48,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:10:48,330 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-09 22:10:48,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 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-09 22:10:48,331 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-09 22:10:48,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 22:10:48,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:10:48,331 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:10:48,343 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-09 22:10:48,531 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-09 22:10:48,532 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:10:48,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:10:48,532 INFO L85 PathProgramCache]: Analyzing trace with hash 144183243, now seen corresponding path program 2 times [2024-11-09 22:10:48,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:10:48,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371881613] [2024-11-09 22:10:48,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:48,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:10:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:48,641 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 22:10:48,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:10:48,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371881613] [2024-11-09 22:10:48,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371881613] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:48,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888480185] [2024-11-09 22:10:48,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:10:48,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:48,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:10:48,644 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-09 22:10:48,645 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-09 22:10:48,714 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:10:48,714 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:10:48,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 22:10:48,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:10:48,766 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 22:10:48,767 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:10:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 22:10:48,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888480185] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:10:48,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:10:48,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-11-09 22:10:48,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591623618] [2024-11-09 22:10:48,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:10:48,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 22:10:48,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:10:48,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 22:10:48,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-09 22:10:48,821 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-09 22:10:48,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:10:48,866 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2024-11-09 22:10:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 22:10:48,867 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-09 22:10:48,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:10:48,868 INFO L225 Difference]: With dead ends: 63 [2024-11-09 22:10:48,868 INFO L226 Difference]: Without dead ends: 57 [2024-11-09 22:10:48,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-09 22:10:48,868 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:10:48,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 160 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:10:48,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-09 22:10:48,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2024-11-09 22:10:48,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 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-09 22:10:48,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-11-09 22:10:48,873 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 29 [2024-11-09 22:10:48,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:10:48,873 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-11-09 22:10:48,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-09 22:10:48,874 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2024-11-09 22:10:48,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 22:10:48,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:10:48,874 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:10:48,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 22:10:49,078 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-09 22:10:49,079 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:10:49,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:10:49,079 INFO L85 PathProgramCache]: Analyzing trace with hash 573910508, now seen corresponding path program 3 times [2024-11-09 22:10:49,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:10:49,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030432950] [2024-11-09 22:10:49,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:49,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:10:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:49,430 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:10:49,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:10:49,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030432950] [2024-11-09 22:10:49,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030432950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:49,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566739434] [2024-11-09 22:10:49,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 22:10:49,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:49,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:10:49,433 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-09 22:10:49,434 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-09 22:10:49,495 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 22:10:49,495 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:10:49,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-09 22:10:49,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:10:49,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:10:49,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:10:49,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:10:49,590 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 22:10:49,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 22:10:49,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 22:10:49,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-09 22:10:49,821 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:10:49,821 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:10:53,919 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_23|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_23| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_23|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_23| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_23| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_23|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_23|) 0))))) is different from false [2024-11-09 22:10:54,079 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 22:10:54,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566739434] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:10:54,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:10:54,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2024-11-09 22:10:54,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382896387] [2024-11-09 22:10:54,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:10:54,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 22:10:54,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:10:54,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 22:10:54,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=331, Unknown=1, NotChecked=36, Total=420 [2024-11-09 22:10:54,085 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 21 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 21 states have internal predecessors, (53), 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-09 22:10:58,139 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_23|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_23| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_23|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_23| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_23| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_23|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_23|) 0))))) is different from false [2024-11-09 22:10:58,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:10:58,268 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2024-11-09 22:10:58,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 22:10:58,269 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 21 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 22:10:58,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:10:58,269 INFO L225 Difference]: With dead ends: 84 [2024-11-09 22:10:58,270 INFO L226 Difference]: Without dead ends: 68 [2024-11-09 22:10:58,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=54, Invalid=332, Unknown=2, NotChecked=74, Total=462 [2024-11-09 22:10:58,270 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:10:58,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 337 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 59 Unchecked, 0.2s Time] [2024-11-09 22:10:58,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-09 22:10:58,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2024-11-09 22:10:58,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.126984126984127) internal successors, (71), 63 states have internal predecessors, (71), 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-09 22:10:58,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2024-11-09 22:10:58,279 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 31 [2024-11-09 22:10:58,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:10:58,280 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2024-11-09 22:10:58,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 21 states have internal predecessors, (53), 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-09 22:10:58,280 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2024-11-09 22:10:58,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 22:10:58,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:10:58,281 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:10:58,296 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-09 22:10:58,481 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-09 22:10:58,481 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:10:58,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:10:58,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1776422854, now seen corresponding path program 1 times [2024-11-09 22:10:58,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:10:58,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326179437] [2024-11-09 22:10:58,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:58,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:10:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:58,552 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 22:10:58,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:10:58,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326179437] [2024-11-09 22:10:58,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326179437] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:58,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414714631] [2024-11-09 22:10:58,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:58,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:58,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:10:58,556 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-09 22:10:58,557 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-09 22:10:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:58,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 22:10:58,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:10:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 22:10:58,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:10:58,697 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 22:10:58,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414714631] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:10:58,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:10:58,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2024-11-09 22:10:58,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932798844] [2024-11-09 22:10:58,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:10:58,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 22:10:58,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:10:58,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 22:10:58,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 22:10:58,699 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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-09 22:10:58,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:10:58,780 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2024-11-09 22:10:58,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 22:10:58,780 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-09 22:10:58,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:10:58,782 INFO L225 Difference]: With dead ends: 79 [2024-11-09 22:10:58,782 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 22:10:58,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-09 22:10:58,782 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 49 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:10:58,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 119 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:10:58,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 22:10:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2024-11-09 22:10:58,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:10:58,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2024-11-09 22:10:58,791 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 32 [2024-11-09 22:10:58,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:10:58,791 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-11-09 22:10:58,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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-09 22:10:58,792 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2024-11-09 22:10:58,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 22:10:58,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:10:58,793 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:10:58,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 22:10:58,997 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-09 22:10:58,998 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:10:58,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:10:58,999 INFO L85 PathProgramCache]: Analyzing trace with hash 520968018, now seen corresponding path program 4 times [2024-11-09 22:10:58,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:10:58,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718759526] [2024-11-09 22:10:58,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:58,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:10:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:59,060 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 22:10:59,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:10:59,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718759526] [2024-11-09 22:10:59,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718759526] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:59,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961305133] [2024-11-09 22:10:59,063 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 22:10:59,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:59,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:10:59,065 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:10:59,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 22:10:59,128 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 22:10:59,128 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:10:59,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 22:10:59,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:10:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 22:10:59,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:10:59,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961305133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:10:59,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 22:10:59,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-11-09 22:10:59,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182716782] [2024-11-09 22:10:59,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:10:59,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 22:10:59,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:10:59,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 22:10:59,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 22:10:59,162 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-09 22:10:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:10:59,211 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2024-11-09 22:10:59,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 22:10:59,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-09 22:10:59,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:10:59,212 INFO L225 Difference]: With dead ends: 68 [2024-11-09 22:10:59,212 INFO L226 Difference]: Without dead ends: 37 [2024-11-09 22:10:59,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:10:59,213 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:10:59,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 75 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:10:59,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-09 22:10:59,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-09 22:10:59,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 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-09 22:10:59,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-11-09 22:10:59,220 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 35 [2024-11-09 22:10:59,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:10:59,220 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-11-09 22:10:59,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-09 22:10:59,221 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-11-09 22:10:59,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 22:10:59,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:10:59,223 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:10:59,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 22:10:59,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:59,424 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:10:59,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:10:59,425 INFO L85 PathProgramCache]: Analyzing trace with hash -2050397280, now seen corresponding path program 2 times [2024-11-09 22:10:59,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:10:59,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873463007] [2024-11-09 22:10:59,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:59,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:10:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 22:10:59,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:10:59,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873463007] [2024-11-09 22:10:59,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873463007] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:59,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343634114] [2024-11-09 22:10:59,674 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:10:59,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:59,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:10:59,675 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:10:59,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 22:10:59,747 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:10:59,747 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:10:59,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-09 22:10:59,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:10:59,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:10:59,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 22:10:59,835 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 22:10:59,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 22:10:59,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-11-09 22:10:59,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:10:59,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 22:11:00,047 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 22:11:00,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2024-11-09 22:11:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 22:11:00,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:11:00,248 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 22:11:00,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343634114] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:11:00,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:11:00,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2024-11-09 22:11:00,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035772402] [2024-11-09 22:11:00,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:11:00,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 22:11:00,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:11:00,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 22:11:00,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2024-11-09 22:11:00,249 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 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-09 22:11:00,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:11:00,508 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2024-11-09 22:11:00,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 22:11:00,511 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-09 22:11:00,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:11:00,512 INFO L225 Difference]: With dead ends: 47 [2024-11-09 22:11:00,512 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 22:11:00,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2024-11-09 22:11:00,512 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:11:00,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 351 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:11:00,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 22:11:00,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-11-09 22:11:00,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 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-09 22:11:00,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-11-09 22:11:00,518 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 36 [2024-11-09 22:11:00,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:11:00,518 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-11-09 22:11:00,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 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-09 22:11:00,519 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-11-09 22:11:00,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 22:11:00,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:11:00,519 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:11:00,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 22:11:00,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 22:11:00,720 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:11:00,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:11:00,721 INFO L85 PathProgramCache]: Analyzing trace with hash 410970241, now seen corresponding path program 3 times [2024-11-09 22:11:00,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:11:00,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175839542] [2024-11-09 22:11:00,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:11:00,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:11:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:11:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 22:11:00,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:11:00,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175839542] [2024-11-09 22:11:00,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175839542] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:11:00,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496359856] [2024-11-09 22:11:00,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 22:11:00,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:11:00,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:11:00,867 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:11:00,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 22:11:00,944 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 22:11:00,944 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:11:00,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 22:11:00,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:11:01,067 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 22:11:01,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:11:01,119 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 22:11:01,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496359856] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:11:01,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:11:01,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2024-11-09 22:11:01,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776697322] [2024-11-09 22:11:01,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:11:01,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 22:11:01,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:11:01,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 22:11:01,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-09 22:11:01,120 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 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-09 22:11:01,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:11:01,190 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2024-11-09 22:11:01,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 22:11:01,191 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-09 22:11:01,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:11:01,191 INFO L225 Difference]: With dead ends: 78 [2024-11-09 22:11:01,191 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 22:11:01,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-09 22:11:01,192 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:11:01,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 206 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:11:01,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 22:11:01,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2024-11-09 22:11:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 60 states have internal predecessors, (68), 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-09 22:11:01,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-11-09 22:11:01,206 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 38 [2024-11-09 22:11:01,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:11:01,206 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-11-09 22:11:01,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 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-09 22:11:01,207 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-11-09 22:11:01,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 22:11:01,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:11:01,207 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:11:01,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 22:11:01,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:11:01,411 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:11:01,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:11:01,412 INFO L85 PathProgramCache]: Analyzing trace with hash -741822174, now seen corresponding path program 4 times [2024-11-09 22:11:01,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:11:01,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603819661] [2024-11-09 22:11:01,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:11:01,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:11:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:11:02,199 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 22:11:02,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:11:02,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603819661] [2024-11-09 22:11:02,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603819661] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:11:02,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251707761] [2024-11-09 22:11:02,200 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 22:11:02,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:11:02,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:11:02,202 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:11:02,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 22:11:02,268 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 22:11:02,269 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:11:02,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-09 22:11:02,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:11:02,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:11:02,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:11:02,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:11:02,371 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 22:11:02,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 22:11:02,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 22:11:02,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-09 22:11:02,507 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-09 22:11:02,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-09 22:11:02,588 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-09 22:11:02,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 44 [2024-11-09 22:11:02,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2024-11-09 22:11:02,944 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 22:11:02,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:11:07,198 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_46| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46|) 0)) (= (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) 0))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_46| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46|) 0)) (= (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) 0)))) is different from false [2024-11-09 22:11:11,517 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:11:11,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2238 treesize of output 2110 [2024-11-09 22:11:11,533 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:11:11,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:11:11,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9472 treesize of output 8456 [2024-11-09 22:11:12,372 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2024-11-09 22:11:12,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251707761] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:11:12,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:11:12,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 36 [2024-11-09 22:11:12,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803822365] [2024-11-09 22:11:12,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:11:12,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 22:11:12,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:11:12,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 22:11:12,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1095, Unknown=1, NotChecked=66, Total=1260 [2024-11-09 22:11:12,374 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 36 states, 36 states have (on average 2.3333333333333335) internal successors, (84), 36 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:11:16,517 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (and (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= 1 (select |c_#valid| .cse0)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_46| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46|) 0)) (= (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (select (select .cse1 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_46| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46|) 0)) (= (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) 0))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2024-11-09 22:11:16,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:11:16,707 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2024-11-09 22:11:16,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 22:11:16,708 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.3333333333333335) internal successors, (84), 36 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-09 22:11:16,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:11:16,708 INFO L225 Difference]: With dead ends: 101 [2024-11-09 22:11:16,708 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 22:11:16,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=108, Invalid=1158, Unknown=2, NotChecked=138, Total=1406 [2024-11-09 22:11:16,709 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 22:11:16,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 496 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 354 Invalid, 0 Unknown, 95 Unchecked, 0.3s Time] [2024-11-09 22:11:16,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 22:11:16,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2024-11-09 22:11:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.1153846153846154) internal successors, (87), 78 states have internal predecessors, (87), 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-09 22:11:16,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2024-11-09 22:11:16,715 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 40 [2024-11-09 22:11:16,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:11:16,715 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2024-11-09 22:11:16,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.3333333333333335) internal successors, (84), 36 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:11:16,715 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2024-11-09 22:11:16,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 22:11:16,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:11:16,716 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:11:16,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 22:11:16,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 22:11:16,917 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:11:16,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:11:16,917 INFO L85 PathProgramCache]: Analyzing trace with hash 527242482, now seen corresponding path program 5 times [2024-11-09 22:11:16,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:11:16,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888814193] [2024-11-09 22:11:16,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:11:16,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:11:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:11:17,019 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 22:11:17,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:11:17,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888814193] [2024-11-09 22:11:17,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888814193] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:11:17,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602311021] [2024-11-09 22:11:17,019 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 22:11:17,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:11:17,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:11:17,021 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:11:17,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 22:11:17,103 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-09 22:11:17,104 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:11:17,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 22:11:17,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:11:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 22:11:17,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:11:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 22:11:17,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602311021] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:11:17,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:11:17,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2024-11-09 22:11:17,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844641174] [2024-11-09 22:11:17,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:11:17,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 22:11:17,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:11:17,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 22:11:17,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:11:17,222 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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-09 22:11:17,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:11:17,333 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2024-11-09 22:11:17,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 22:11:17,333 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-09 22:11:17,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:11:17,334 INFO L225 Difference]: With dead ends: 96 [2024-11-09 22:11:17,334 INFO L226 Difference]: Without dead ends: 80 [2024-11-09 22:11:17,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2024-11-09 22:11:17,334 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 52 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:11:17,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 146 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:11:17,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-09 22:11:17,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2024-11-09 22:11:17,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 68 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:11:17,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2024-11-09 22:11:17,339 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 41 [2024-11-09 22:11:17,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:11:17,340 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2024-11-09 22:11:17,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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-09 22:11:17,340 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2024-11-09 22:11:17,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 22:11:17,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:11:17,340 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:11:17,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 22:11:17,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 22:11:17,541 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:11:17,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:11:17,542 INFO L85 PathProgramCache]: Analyzing trace with hash -586324344, now seen corresponding path program 6 times [2024-11-09 22:11:17,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:11:17,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268302256] [2024-11-09 22:11:17,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:11:17,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:11:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:11:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 22:11:17,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:11:17,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268302256] [2024-11-09 22:11:17,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268302256] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:11:17,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785187328] [2024-11-09 22:11:17,633 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 22:11:17,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:11:17,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:11:17,635 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:11:17,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 22:11:17,724 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-09 22:11:17,724 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:11:17,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 22:11:17,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:11:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 22:11:17,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:11:17,804 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 22:11:17,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785187328] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:11:17,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:11:17,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2024-11-09 22:11:17,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360880909] [2024-11-09 22:11:17,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:11:17,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 22:11:17,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:11:17,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 22:11:17,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 22:11:17,805 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 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-09 22:11:17,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:11:17,860 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2024-11-09 22:11:17,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 22:11:17,860 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-09 22:11:17,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:11:17,861 INFO L225 Difference]: With dead ends: 83 [2024-11-09 22:11:17,861 INFO L226 Difference]: Without dead ends: 46 [2024-11-09 22:11:17,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-09 22:11:17,861 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:11:17,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 121 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:11:17,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-09 22:11:17,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-09 22:11:17,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 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-09 22:11:17,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2024-11-09 22:11:17,865 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 44 [2024-11-09 22:11:17,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:11:17,865 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2024-11-09 22:11:17,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 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-09 22:11:17,865 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2024-11-09 22:11:17,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 22:11:17,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:11:17,868 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:11:17,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 22:11:18,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 22:11:18,068 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:11:18,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:11:18,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1615743832, now seen corresponding path program 7 times [2024-11-09 22:11:18,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:11:18,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579480755] [2024-11-09 22:11:18,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:11:18,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:11:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:11:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 22:11:18,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:11:18,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579480755] [2024-11-09 22:11:18,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579480755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:11:18,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309698332] [2024-11-09 22:11:18,534 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 22:11:18,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:11:18,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:11:18,535 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:11:18,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 22:11:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:11:18,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-09 22:11:18,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:11:18,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:11:18,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 22:11:18,659 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 22:11:18,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 22:11:18,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-11-09 22:11:18,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:11:18,750 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-09 22:11:18,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-09 22:11:18,807 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-09 22:11:18,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 38 [2024-11-09 22:11:18,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-09 22:11:19,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:11:19,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-09 22:11:19,100 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2024-11-09 22:11:19,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 30 [2024-11-09 22:11:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 22:11:19,104 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:11:21,041 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:11:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 22:11:21,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309698332] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:11:21,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:11:21,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 33 [2024-11-09 22:11:21,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738814072] [2024-11-09 22:11:21,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:11:21,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 22:11:21,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:11:21,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 22:11:21,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=962, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 22:11:21,329 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 33 states, 33 states have (on average 2.3636363636363638) internal successors, (78), 33 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:11:29,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 22:11:34,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 22:11:35,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 22:11:44,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 22:12:10,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]