./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b05b18c0458ef705f828769f88cc2a590589ce4d5c3f0e48f99be90a949f7ed4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:12:33,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:12:33,409 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:12:33,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:12:33,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:12:33,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:12:33,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:12:33,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:12:33,441 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:12:33,441 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:12:33,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:12:33,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:12:33,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:12:33,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:12:33,445 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:12:33,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:12:33,446 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:12:33,446 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:12:33,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:12:33,446 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:12:33,447 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:12:33,450 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:12:33,450 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:12:33,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:12:33,450 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:12:33,450 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:12:33,451 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:12:33,451 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:12:33,451 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:12:33,451 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:12:33,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:12:33,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:12:33,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:12:33,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:12:33,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:12:33,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:12:33,453 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:12:33,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:12:33,453 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:12:33,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:12:33,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:12:33,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:12:33,455 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> b05b18c0458ef705f828769f88cc2a590589ce4d5c3f0e48f99be90a949f7ed4 [2024-10-11 18:12:33,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:12:33,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:12:33,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:12:33,719 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:12:33,719 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:12:33,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i [2024-10-11 18:12:35,016 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:12:35,234 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:12:35,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i [2024-10-11 18:12:35,252 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1133625be/ebda5ae9d3d2454e97bf7d84ac6de7fa/FLAG5c042fd3d [2024-10-11 18:12:35,589 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1133625be/ebda5ae9d3d2454e97bf7d84ac6de7fa [2024-10-11 18:12:35,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:12:35,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:12:35,594 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:12:35,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:12:35,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:12:35,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:12:35" (1/1) ... [2024-10-11 18:12:35,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d2e00b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:35, skipping insertion in model container [2024-10-11 18:12:35,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:12:35" (1/1) ... [2024-10-11 18:12:35,635 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:12:35,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:12:36,006 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:12:36,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:12:36,080 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:12:36,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:36 WrapperNode [2024-10-11 18:12:36,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:12:36,082 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:12:36,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:12:36,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:12:36,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:36" (1/1) ... [2024-10-11 18:12:36,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:36" (1/1) ... [2024-10-11 18:12:36,127 INFO L138 Inliner]: procedures = 119, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 135 [2024-10-11 18:12:36,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:12:36,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:12:36,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:12:36,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:12:36,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:36" (1/1) ... [2024-10-11 18:12:36,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:36" (1/1) ... [2024-10-11 18:12:36,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:36" (1/1) ... [2024-10-11 18:12:36,171 INFO L175 MemorySlicer]: Split 24 memory accesses to 2 slices as follows [2, 22]. 92 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2024-10-11 18:12:36,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:36" (1/1) ... [2024-10-11 18:12:36,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:36" (1/1) ... [2024-10-11 18:12:36,186 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:36" (1/1) ... [2024-10-11 18:12:36,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:36" (1/1) ... [2024-10-11 18:12:36,191 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:36" (1/1) ... [2024-10-11 18:12:36,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:36" (1/1) ... [2024-10-11 18:12:36,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:12:36,203 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:12:36,203 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:12:36,203 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:12:36,204 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:36" (1/1) ... [2024-10-11 18:12:36,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:12:36,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:12:36,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:12:36,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:12:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-11 18:12:36,279 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-11 18:12:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 18:12:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 18:12:36,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 18:12:36,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 18:12:36,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:12:36,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:12:36,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:12:36,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:12:36,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:12:36,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:12:36,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:12:36,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 18:12:36,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 18:12:36,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:12:36,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:12:36,388 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:12:36,389 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:12:36,724 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-10-11 18:12:36,724 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:12:36,769 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:12:36,769 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-11 18:12:36,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:12:36 BoogieIcfgContainer [2024-10-11 18:12:36,772 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:12:36,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:12:36,774 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:12:36,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:12:36,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:12:35" (1/3) ... [2024-10-11 18:12:36,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbad5cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:12:36, skipping insertion in model container [2024-10-11 18:12:36,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:36" (2/3) ... [2024-10-11 18:12:36,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbad5cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:12:36, skipping insertion in model container [2024-10-11 18:12:36,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:12:36" (3/3) ... [2024-10-11 18:12:36,783 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-1.i [2024-10-11 18:12:36,798 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:12:36,798 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2024-10-11 18:12:36,841 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:12:36,847 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=None, 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;@583201b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:12:36,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2024-10-11 18:12:36,851 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 59 states have (on average 2.3559322033898304) internal successors, (139), 117 states have internal predecessors, (139), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:12:36,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 18:12:36,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:36,857 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 18:12:36,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:12:36,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:36,862 INFO L85 PathProgramCache]: Analyzing trace with hash 9158, now seen corresponding path program 1 times [2024-10-11 18:12:36,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:36,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743664873] [2024-10-11 18:12:36,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:36,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:37,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:37,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:37,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743664873] [2024-10-11 18:12:37,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743664873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:37,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:37,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:12:37,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103508930] [2024-10-11 18:12:37,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:37,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:12:37,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:37,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:12:37,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:12:37,105 INFO L87 Difference]: Start difference. First operand has 123 states, 59 states have (on average 2.3559322033898304) internal successors, (139), 117 states have internal predecessors, (139), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:37,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:37,256 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2024-10-11 18:12:37,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:12:37,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-10-11 18:12:37,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:37,267 INFO L225 Difference]: With dead ends: 142 [2024-10-11 18:12:37,267 INFO L226 Difference]: Without dead ends: 141 [2024-10-11 18:12:37,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:12:37,272 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 95 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:37,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 84 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:37,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-11 18:12:37,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2024-10-11 18:12:37,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 58 states have (on average 2.1551724137931036) internal successors, (125), 116 states have internal predecessors, (125), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:37,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2024-10-11 18:12:37,326 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 2 [2024-10-11 18:12:37,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:37,326 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2024-10-11 18:12:37,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:37,326 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2024-10-11 18:12:37,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 18:12:37,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:37,326 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 18:12:37,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:12:37,327 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:12:37,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:37,328 INFO L85 PathProgramCache]: Analyzing trace with hash 9159, now seen corresponding path program 1 times [2024-10-11 18:12:37,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:37,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009482718] [2024-10-11 18:12:37,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:37,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:37,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:37,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:37,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009482718] [2024-10-11 18:12:37,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009482718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:37,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:37,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:12:37,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374741876] [2024-10-11 18:12:37,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:37,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:12:37,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:37,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:12:37,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:12:37,426 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:37,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:37,524 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2024-10-11 18:12:37,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:12:37,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-10-11 18:12:37,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:37,526 INFO L225 Difference]: With dead ends: 115 [2024-10-11 18:12:37,526 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 18:12:37,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:12:37,527 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 103 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:37,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:37,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 18:12:37,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-11 18:12:37,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 58 states have (on average 2.086206896551724) internal successors, (121), 113 states have internal predecessors, (121), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:37,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2024-10-11 18:12:37,542 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 2 [2024-10-11 18:12:37,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:37,543 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2024-10-11 18:12:37,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:37,543 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2024-10-11 18:12:37,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 18:12:37,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:37,543 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 18:12:37,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:12:37,544 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:12:37,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:37,544 INFO L85 PathProgramCache]: Analyzing trace with hash 8808112, now seen corresponding path program 1 times [2024-10-11 18:12:37,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:37,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17041687] [2024-10-11 18:12:37,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:37,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:37,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:37,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:37,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17041687] [2024-10-11 18:12:37,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17041687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:37,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:37,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:12:37,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842013218] [2024-10-11 18:12:37,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:37,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:12:37,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:37,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:12:37,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:12:37,652 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:37,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:37,743 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2024-10-11 18:12:37,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:12:37,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 18:12:37,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:37,745 INFO L225 Difference]: With dead ends: 110 [2024-10-11 18:12:37,745 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 18:12:37,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:12:37,746 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 76 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:37,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 72 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:37,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 18:12:37,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-11 18:12:37,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 108 states have internal predecessors, (117), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:37,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2024-10-11 18:12:37,759 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 4 [2024-10-11 18:12:37,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:37,759 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2024-10-11 18:12:37,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:37,760 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2024-10-11 18:12:37,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 18:12:37,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:37,760 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 18:12:37,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:12:37,761 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:12:37,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:37,761 INFO L85 PathProgramCache]: Analyzing trace with hash 8808113, now seen corresponding path program 1 times [2024-10-11 18:12:37,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:37,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910035948] [2024-10-11 18:12:37,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:37,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:37,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:37,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910035948] [2024-10-11 18:12:37,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910035948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:37,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:37,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:12:37,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851449067] [2024-10-11 18:12:37,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:37,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:12:37,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:37,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:12:37,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:12:37,878 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:37,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:37,970 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2024-10-11 18:12:37,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:12:37,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 18:12:37,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:37,972 INFO L225 Difference]: With dead ends: 113 [2024-10-11 18:12:37,973 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 18:12:37,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:12:37,975 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 70 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:37,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 86 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:37,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 18:12:37,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-11 18:12:37,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 64 states have (on average 1.875) internal successors, (120), 111 states have internal predecessors, (120), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:37,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2024-10-11 18:12:37,984 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 4 [2024-10-11 18:12:37,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:37,984 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2024-10-11 18:12:37,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:37,985 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2024-10-11 18:12:37,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 18:12:37,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:37,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:37,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:12:37,986 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:12:37,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:37,987 INFO L85 PathProgramCache]: Analyzing trace with hash -185072300, now seen corresponding path program 1 times [2024-10-11 18:12:37,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:37,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477143632] [2024-10-11 18:12:37,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:37,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:38,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:38,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:38,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477143632] [2024-10-11 18:12:38,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477143632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:38,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:38,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:12:38,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143546479] [2024-10-11 18:12:38,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:38,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:12:38,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:38,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:12:38,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:12:38,153 INFO L87 Difference]: Start difference. First operand 113 states and 124 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:38,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:38,314 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2024-10-11 18:12:38,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:12:38,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 18:12:38,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:38,316 INFO L225 Difference]: With dead ends: 104 [2024-10-11 18:12:38,316 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 18:12:38,316 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-10-11 18:12:38,317 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 93 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:38,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 65 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:38,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 18:12:38,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-11 18:12:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 66 states have (on average 1.7121212121212122) internal successors, (113), 102 states have internal predecessors, (113), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:38,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2024-10-11 18:12:38,326 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 8 [2024-10-11 18:12:38,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:38,327 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2024-10-11 18:12:38,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:38,327 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2024-10-11 18:12:38,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 18:12:38,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:38,328 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:38,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:12:38,331 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:12:38,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:38,331 INFO L85 PathProgramCache]: Analyzing trace with hash -185072299, now seen corresponding path program 1 times [2024-10-11 18:12:38,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:38,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219235656] [2024-10-11 18:12:38,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:38,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:38,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:38,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:38,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219235656] [2024-10-11 18:12:38,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219235656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:38,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:38,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:12:38,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849294969] [2024-10-11 18:12:38,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:38,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:12:38,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:38,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:12:38,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:12:38,513 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:38,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:38,646 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2024-10-11 18:12:38,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:12:38,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 18:12:38,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:38,650 INFO L225 Difference]: With dead ends: 111 [2024-10-11 18:12:38,650 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 18:12:38,650 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-10-11 18:12:38,651 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 83 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:38,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 98 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:38,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 18:12:38,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-10-11 18:12:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 73 states have (on average 1.643835616438356) internal successors, (120), 108 states have internal predecessors, (120), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2024-10-11 18:12:38,659 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 8 [2024-10-11 18:12:38,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:38,659 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2024-10-11 18:12:38,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2024-10-11 18:12:38,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:12:38,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:38,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:38,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 18:12:38,660 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:12:38,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:38,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1760598694, now seen corresponding path program 1 times [2024-10-11 18:12:38,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:38,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922031115] [2024-10-11 18:12:38,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:38,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:38,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:38,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:38,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922031115] [2024-10-11 18:12:38,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922031115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:38,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:38,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:12:38,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774923961] [2024-10-11 18:12:38,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:38,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:12:38,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:38,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:12:38,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:38,775 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:38,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:38,932 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2024-10-11 18:12:38,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:12:38,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 18:12:38,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:38,933 INFO L225 Difference]: With dead ends: 109 [2024-10-11 18:12:38,933 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 18:12:38,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:12:38,935 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 23 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:38,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 172 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:38,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 18:12:38,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-11 18:12:38,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 73 states have (on average 1.63013698630137) internal successors, (119), 107 states have internal predecessors, (119), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2024-10-11 18:12:38,942 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 10 [2024-10-11 18:12:38,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:38,943 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2024-10-11 18:12:38,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:38,943 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2024-10-11 18:12:38,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:12:38,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:38,943 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:38,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 18:12:38,944 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:12:38,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:38,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1760598693, now seen corresponding path program 1 times [2024-10-11 18:12:38,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:38,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076480604] [2024-10-11 18:12:38,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:38,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:39,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:39,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:39,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076480604] [2024-10-11 18:12:39,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076480604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:39,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:39,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:12:39,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68712097] [2024-10-11 18:12:39,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:39,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:12:39,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:39,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:12:39,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:39,121 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:39,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:39,280 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2024-10-11 18:12:39,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:12:39,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 18:12:39,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:39,281 INFO L225 Difference]: With dead ends: 109 [2024-10-11 18:12:39,281 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 18:12:39,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:12:39,281 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 9 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:39,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 219 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:39,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 18:12:39,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2024-10-11 18:12:39,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 102 states have internal predecessors, (114), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:39,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2024-10-11 18:12:39,286 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 10 [2024-10-11 18:12:39,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:39,287 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2024-10-11 18:12:39,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:39,287 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2024-10-11 18:12:39,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 18:12:39,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:39,288 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:39,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 18:12:39,288 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:12:39,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:39,289 INFO L85 PathProgramCache]: Analyzing trace with hash 51318175, now seen corresponding path program 1 times [2024-10-11 18:12:39,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:39,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141490785] [2024-10-11 18:12:39,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:39,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:39,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:39,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:39,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141490785] [2024-10-11 18:12:39,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141490785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:39,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:39,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:12:39,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669026726] [2024-10-11 18:12:39,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:39,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:12:39,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:39,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:12:39,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:39,342 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:39,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:39,493 INFO L93 Difference]: Finished difference Result 139 states and 155 transitions. [2024-10-11 18:12:39,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:12:39,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 18:12:39,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:39,495 INFO L225 Difference]: With dead ends: 139 [2024-10-11 18:12:39,495 INFO L226 Difference]: Without dead ends: 139 [2024-10-11 18:12:39,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:12:39,497 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 175 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:39,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 111 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:39,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-11 18:12:39,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 106. [2024-10-11 18:12:39,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.5263157894736843) internal successors, (116), 104 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2024-10-11 18:12:39,507 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 12 [2024-10-11 18:12:39,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:39,508 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2024-10-11 18:12:39,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:39,508 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2024-10-11 18:12:39,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:12:39,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:39,508 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:39,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 18:12:39,509 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:12:39,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:39,509 INFO L85 PathProgramCache]: Analyzing trace with hash -870673650, now seen corresponding path program 1 times [2024-10-11 18:12:39,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:39,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354140304] [2024-10-11 18:12:39,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:39,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:39,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:39,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:39,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354140304] [2024-10-11 18:12:39,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354140304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:39,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:39,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:12:39,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971572004] [2024-10-11 18:12:39,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:39,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:12:39,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:39,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:12:39,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:12:39,746 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:39,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:39,946 INFO L93 Difference]: Finished difference Result 147 states and 167 transitions. [2024-10-11 18:12:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:12:39,947 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 18:12:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:39,948 INFO L225 Difference]: With dead ends: 147 [2024-10-11 18:12:39,948 INFO L226 Difference]: Without dead ends: 147 [2024-10-11 18:12:39,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:12:39,949 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 149 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:39,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 225 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:12:39,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-11 18:12:39,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 113. [2024-10-11 18:12:39,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 83 states have (on average 1.4939759036144578) internal successors, (124), 111 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:39,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2024-10-11 18:12:39,956 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 15 [2024-10-11 18:12:39,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:39,956 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2024-10-11 18:12:39,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:39,956 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2024-10-11 18:12:39,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:12:39,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:39,956 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:39,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 18:12:39,957 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:12:39,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:39,957 INFO L85 PathProgramCache]: Analyzing trace with hash -455457430, now seen corresponding path program 1 times [2024-10-11 18:12:39,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:39,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891115936] [2024-10-11 18:12:39,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:39,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:40,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:40,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:40,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891115936] [2024-10-11 18:12:40,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891115936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:40,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:40,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:12:40,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80518795] [2024-10-11 18:12:40,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:40,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:12:40,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:40,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:12:40,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:40,065 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:40,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:40,206 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2024-10-11 18:12:40,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:12:40,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2024-10-11 18:12:40,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:40,208 INFO L225 Difference]: With dead ends: 112 [2024-10-11 18:12:40,208 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 18:12:40,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:12:40,209 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 22 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:40,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 164 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:40,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 18:12:40,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-11 18:12:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 110 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2024-10-11 18:12:40,212 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 15 [2024-10-11 18:12:40,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:40,213 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2024-10-11 18:12:40,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:40,213 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2024-10-11 18:12:40,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:12:40,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:40,214 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:40,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 18:12:40,214 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:12:40,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:40,215 INFO L85 PathProgramCache]: Analyzing trace with hash -455457429, now seen corresponding path program 1 times [2024-10-11 18:12:40,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:40,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569836590] [2024-10-11 18:12:40,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:40,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:40,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-10-11 18:12:40,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:40,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569836590] [2024-10-11 18:12:40,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569836590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:40,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:40,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:12:40,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822686883] [2024-10-11 18:12:40,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:40,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:12:40,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:40,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:12:40,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:40,416 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:40,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:40,534 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2024-10-11 18:12:40,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:12:40,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2024-10-11 18:12:40,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:40,535 INFO L225 Difference]: With dead ends: 109 [2024-10-11 18:12:40,535 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 18:12:40,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:40,536 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 5 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:40,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 210 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:40,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 18:12:40,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2024-10-11 18:12:40,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 102 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2024-10-11 18:12:40,539 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 15 [2024-10-11 18:12:40,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:40,539 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2024-10-11 18:12:40,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:40,540 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2024-10-11 18:12:40,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:12:40,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:40,540 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:40,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 18:12:40,541 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:12:40,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:40,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1056559518, now seen corresponding path program 1 times [2024-10-11 18:12:40,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:40,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143136878] [2024-10-11 18:12:40,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:40,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:40,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:40,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143136878] [2024-10-11 18:12:40,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143136878] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:12:40,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969148783] [2024-10-11 18:12:40,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:40,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:12:40,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:12:40,694 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:12:40,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:12:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:40,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 18:12:40,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:12:40,858 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-10-11 18:12:40,867 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-10-11 18:12:40,903 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 11 [2024-10-11 18:12:40,911 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 11 [2024-10-11 18:12:41,055 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 15 treesize of output 7 [2024-10-11 18:12:41,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:41,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:12:41,354 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 10 treesize of output 8 [2024-10-11 18:12:41,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 12 [2024-10-11 18:12:41,369 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 10 treesize of output 8 [2024-10-11 18:12:41,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:12:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:41,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969148783] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:12:41,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:12:41,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2024-10-11 18:12:41,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691700826] [2024-10-11 18:12:41,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:12:41,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:12:41,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:41,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:12:41,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:12:41,387 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:41,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:41,715 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2024-10-11 18:12:41,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:12:41,715 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 18:12:41,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:41,716 INFO L225 Difference]: With dead ends: 137 [2024-10-11 18:12:41,716 INFO L226 Difference]: Without dead ends: 137 [2024-10-11 18:12:41,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 18:12:41,717 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 202 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:41,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 256 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:12:41,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-11 18:12:41,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 131. [2024-10-11 18:12:41,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 106 states have (on average 1.4433962264150944) internal successors, (153), 129 states have internal predecessors, (153), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:41,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 156 transitions. [2024-10-11 18:12:41,721 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 156 transitions. Word has length 19 [2024-10-11 18:12:41,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:41,721 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 156 transitions. [2024-10-11 18:12:41,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:41,721 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 156 transitions. [2024-10-11 18:12:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:12:41,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:41,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:41,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 18:12:41,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 18:12:41,923 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:12:41,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:41,923 INFO L85 PathProgramCache]: Analyzing trace with hash 478631280, now seen corresponding path program 1 times [2024-10-11 18:12:41,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:41,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321903489] [2024-10-11 18:12:41,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:41,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:41,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:41,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:41,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321903489] [2024-10-11 18:12:41,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321903489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:41,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:41,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:12:41,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664818248] [2024-10-11 18:12:41,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:41,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:12:41,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:41,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:12:41,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:41,974 INFO L87 Difference]: Start difference. First operand 131 states and 156 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:42,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:42,075 INFO L93 Difference]: Finished difference Result 128 states and 151 transitions. [2024-10-11 18:12:42,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:12:42,075 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-11 18:12:42,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:42,076 INFO L225 Difference]: With dead ends: 128 [2024-10-11 18:12:42,076 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 18:12:42,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:12:42,077 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 5 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:42,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 210 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:42,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 18:12:42,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-10-11 18:12:42,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 103 states have (on average 1.4368932038834952) internal successors, (148), 126 states have internal predecessors, (148), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 151 transitions. [2024-10-11 18:12:42,080 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 151 transitions. Word has length 21 [2024-10-11 18:12:42,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:42,081 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 151 transitions. [2024-10-11 18:12:42,081 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:42,081 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 151 transitions. [2024-10-11 18:12:42,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:12:42,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:42,081 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, 1] [2024-10-11 18:12:42,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 18:12:42,082 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:12:42,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:42,082 INFO L85 PathProgramCache]: Analyzing trace with hash 2144799511, now seen corresponding path program 1 times [2024-10-11 18:12:42,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:42,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807687005] [2024-10-11 18:12:42,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:42,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:42,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:42,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:42,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807687005] [2024-10-11 18:12:42,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807687005] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:12:42,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134380819] [2024-10-11 18:12:42,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:42,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:12:42,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:12:42,504 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:12:42,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:12:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:42,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 18:12:42,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:12:42,640 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-10-11 18:12:42,665 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-10-11 18:12:42,724 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:12:42,724 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-10-11 18:12:42,757 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-10-11 18:12:42,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:12:42,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 18:12:42,791 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-10-11 18:12:42,815 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 16 treesize of output 11 [2024-10-11 18:12:42,831 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 16 treesize of output 11 [2024-10-11 18:12:42,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:42,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:12:42,909 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_532 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_532) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 1)) is different from false [2024-10-11 18:12:43,031 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:12:43,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:43,035 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2024-10-11 18:12:43,040 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 36 treesize of output 24 [2024-10-11 18:12:43,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-10-11 18:12:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:43,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134380819] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:12:43,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:12:43,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 26 [2024-10-11 18:12:43,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320756753] [2024-10-11 18:12:43,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:12:43,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 18:12:43,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:43,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 18:12:44,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=483, Unknown=17, NotChecked=46, Total=650 [2024-10-11 18:12:44,000 INFO L87 Difference]: Start difference. First operand 128 states and 151 transitions. Second operand has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:44,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:44,921 INFO L93 Difference]: Finished difference Result 177 states and 207 transitions. [2024-10-11 18:12:44,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 18:12:44,921 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-11 18:12:44,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:44,922 INFO L225 Difference]: With dead ends: 177 [2024-10-11 18:12:44,922 INFO L226 Difference]: Without dead ends: 177 [2024-10-11 18:12:44,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=312, Invalid=1007, Unknown=17, NotChecked=70, Total=1406 [2024-10-11 18:12:44,923 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 464 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:44,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 503 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1018 Invalid, 0 Unknown, 139 Unchecked, 0.6s Time] [2024-10-11 18:12:44,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-11 18:12:44,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 140. [2024-10-11 18:12:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 138 states have internal predecessors, (162), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 165 transitions. [2024-10-11 18:12:44,927 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 165 transitions. Word has length 22 [2024-10-11 18:12:44,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:44,927 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 165 transitions. [2024-10-11 18:12:44,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:44,928 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 165 transitions. [2024-10-11 18:12:44,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:12:44,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:44,928 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:44,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 18:12:45,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 18:12:45,130 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:12:45,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:45,131 INFO L85 PathProgramCache]: Analyzing trace with hash -177692776, now seen corresponding path program 1 times [2024-10-11 18:12:45,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:45,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950558005] [2024-10-11 18:12:45,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:45,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:12:45,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:45,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950558005] [2024-10-11 18:12:45,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950558005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:45,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:45,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:12:45,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017352199] [2024-10-11 18:12:45,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:45,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:12:45,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:45,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:12:45,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:12:45,169 INFO L87 Difference]: Start difference. First operand 140 states and 165 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:45,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:45,224 INFO L93 Difference]: Finished difference Result 142 states and 164 transitions. [2024-10-11 18:12:45,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:12:45,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-11 18:12:45,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:45,225 INFO L225 Difference]: With dead ends: 142 [2024-10-11 18:12:45,225 INFO L226 Difference]: Without dead ends: 142 [2024-10-11 18:12:45,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:12:45,226 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 33 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:45,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 81 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:45,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-11 18:12:45,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-11 18:12:45,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 117 states have (on average 1.376068376068376) internal successors, (161), 140 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:45,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 164 transitions. [2024-10-11 18:12:45,231 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 164 transitions. Word has length 24 [2024-10-11 18:12:45,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:45,231 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 164 transitions. [2024-10-11 18:12:45,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:45,231 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 164 transitions. [2024-10-11 18:12:45,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:12:45,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:45,233 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, 1, 1, 1, 1, 1] [2024-10-11 18:12:45,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 18:12:45,234 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:12:45,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:45,234 INFO L85 PathProgramCache]: Analyzing trace with hash -107713440, now seen corresponding path program 1 times [2024-10-11 18:12:45,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:45,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8677003] [2024-10-11 18:12:45,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:45,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:45,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:45,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:45,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8677003] [2024-10-11 18:12:45,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8677003] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:12:45,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435465663] [2024-10-11 18:12:45,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:45,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:12:45,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:12:45,849 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:12:45,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:12:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:45,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-11 18:12:45,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:12:45,958 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-10-11 18:12:45,978 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-10-11 18:12:46,017 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:12:46,017 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-10-11 18:12:46,044 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-10-11 18:12:46,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:12:46,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 18:12:46,088 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-10-11 18:12:46,113 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 16 treesize of output 11 [2024-10-11 18:12:46,133 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:12:46,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:12:46,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:12:46,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:12:46,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-10-11 18:12:46,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 16 treesize of output 8 [2024-10-11 18:12:46,234 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 16 treesize of output 11 [2024-10-11 18:12:46,244 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 16 treesize of output 11 [2024-10-11 18:12:46,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:46,291 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:12:46,315 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_710 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_710) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 1)) is different from false [2024-10-11 18:12:50,359 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_710 (Array Int Int)) (v_ArrVal_708 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_710) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 1)) is different from false [2024-10-11 18:12:51,534 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-11 18:12:51,535 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 13 treesize of output 12 [2024-10-11 18:12:56,015 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:12:56,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:56,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2024-10-11 18:12:56,026 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:12:56,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 36 treesize of output 24 [2024-10-11 18:12:56,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-10-11 18:13:00,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:00,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435465663] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:13:00,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:13:00,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 35 [2024-10-11 18:13:00,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960398457] [2024-10-11 18:13:00,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:13:00,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 18:13:00,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:13:00,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 18:13:00,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=866, Unknown=25, NotChecked=126, Total=1190 [2024-10-11 18:13:00,571 INFO L87 Difference]: Start difference. First operand 142 states and 164 transitions. Second operand has 35 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 35 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:01,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:13:01,444 INFO L93 Difference]: Finished difference Result 202 states and 232 transitions. [2024-10-11 18:13:01,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:13:01,444 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 35 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-11 18:13:01,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:13:01,445 INFO L225 Difference]: With dead ends: 202 [2024-10-11 18:13:01,445 INFO L226 Difference]: Without dead ends: 202 [2024-10-11 18:13:01,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=351, Invalid=1438, Unknown=25, NotChecked=166, Total=1980 [2024-10-11 18:13:01,446 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 320 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 287 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:13:01,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 524 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1164 Invalid, 0 Unknown, 287 Unchecked, 0.6s Time] [2024-10-11 18:13:01,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-11 18:13:01,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 153. [2024-10-11 18:13:01,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 128 states have (on average 1.359375) internal successors, (174), 151 states have internal predecessors, (174), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2024-10-11 18:13:01,451 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 26 [2024-10-11 18:13:01,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:13:01,452 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2024-10-11 18:13:01,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 35 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:01,452 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2024-10-11 18:13:01,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:13:01,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:13:01,453 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:13:01,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 18:13:01,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:13:01,654 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:13:01,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:13:01,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1035941659, now seen corresponding path program 1 times [2024-10-11 18:13:01,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:13:01,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458750541] [2024-10-11 18:13:01,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:01,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:13:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:01,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:01,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:13:01,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458750541] [2024-10-11 18:13:01,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458750541] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:13:01,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097250754] [2024-10-11 18:13:01,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:01,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:13:01,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:13:01,789 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:13:01,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:13:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:01,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 18:13:01,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:13:01,877 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 19 treesize of output 1 [2024-10-11 18:13:01,902 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 19 treesize of output 7 [2024-10-11 18:13:01,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:13:01,909 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:13:01,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097250754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:13:01,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:13:01,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-10-11 18:13:01,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450649757] [2024-10-11 18:13:01,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:13:01,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:13:01,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:13:01,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:13:01,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:13:01,911 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:01,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:13:01,978 INFO L93 Difference]: Finished difference Result 147 states and 168 transitions. [2024-10-11 18:13:01,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:13:01,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2024-10-11 18:13:01,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:13:01,979 INFO L225 Difference]: With dead ends: 147 [2024-10-11 18:13:01,979 INFO L226 Difference]: Without dead ends: 147 [2024-10-11 18:13:01,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:13:01,980 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 4 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:13:01,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 175 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:13:01,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-11 18:13:01,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-10-11 18:13:01,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 122 states have (on average 1.3524590163934427) internal successors, (165), 145 states have internal predecessors, (165), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:01,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 168 transitions. [2024-10-11 18:13:01,983 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 168 transitions. Word has length 26 [2024-10-11 18:13:01,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:13:01,983 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 168 transitions. [2024-10-11 18:13:01,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:01,983 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 168 transitions. [2024-10-11 18:13:01,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:13:01,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:13:01,984 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:13:01,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 18:13:02,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 18:13:02,184 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:13:02,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:13:02,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1345920295, now seen corresponding path program 1 times [2024-10-11 18:13:02,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:13:02,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46705426] [2024-10-11 18:13:02,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:02,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:13:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:02,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:02,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:13:02,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46705426] [2024-10-11 18:13:02,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46705426] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:13:02,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849151465] [2024-10-11 18:13:02,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:02,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:13:02,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:13:02,411 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:13:02,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 18:13:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:02,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 18:13:02,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:13:02,514 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-10-11 18:13:02,568 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:13:02,568 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-10-11 18:13:02,601 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-10-11 18:13:02,671 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-11 18:13:02,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-11 18:13:02,699 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:13:02,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-11 18:13:02,806 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 25 treesize of output 13 [2024-10-11 18:13:02,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:02,830 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:13:03,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:03,005 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-10-11 18:13:03,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:03,012 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 34 treesize of output 37 [2024-10-11 18:13:03,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 9 [2024-10-11 18:13:03,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:03,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849151465] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:13:03,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:13:03,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 26 [2024-10-11 18:13:03,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663662739] [2024-10-11 18:13:03,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:13:03,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 18:13:03,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:13:03,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 18:13:03,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=578, Unknown=6, NotChecked=0, Total=702 [2024-10-11 18:13:03,457 INFO L87 Difference]: Start difference. First operand 147 states and 168 transitions. Second operand has 27 states, 26 states have (on average 2.769230769230769) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:04,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:13:04,340 INFO L93 Difference]: Finished difference Result 212 states and 246 transitions. [2024-10-11 18:13:04,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 18:13:04,340 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.769230769230769) internal successors, (72), 27 states have internal predecessors, (72), 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 26 [2024-10-11 18:13:04,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:13:04,341 INFO L225 Difference]: With dead ends: 212 [2024-10-11 18:13:04,341 INFO L226 Difference]: Without dead ends: 212 [2024-10-11 18:13:04,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=907, Unknown=6, NotChecked=0, Total=1122 [2024-10-11 18:13:04,342 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 245 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:13:04,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 519 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 18:13:04,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-11 18:13:04,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 162. [2024-10-11 18:13:04,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 137 states have (on average 1.3357664233576643) internal successors, (183), 160 states have internal predecessors, (183), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:04,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 186 transitions. [2024-10-11 18:13:04,345 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 186 transitions. Word has length 26 [2024-10-11 18:13:04,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:13:04,345 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 186 transitions. [2024-10-11 18:13:04,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.769230769230769) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:04,345 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 186 transitions. [2024-10-11 18:13:04,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:13:04,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:13:04,345 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:13:04,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 18:13:04,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:13:04,546 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:13:04,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:13:04,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1345920296, now seen corresponding path program 1 times [2024-10-11 18:13:04,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:13:04,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679107397] [2024-10-11 18:13:04,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:04,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:13:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:04,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:13:04,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679107397] [2024-10-11 18:13:04,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679107397] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:13:04,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406145058] [2024-10-11 18:13:04,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:04,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:13:04,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:13:04,872 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:13:04,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 18:13:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:04,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-11 18:13:04,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:13:04,961 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-10-11 18:13:04,982 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:13:04,982 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-10-11 18:13:04,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-10-11 18:13:05,012 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-10-11 18:13:05,022 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-10-11 18:13:05,071 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-11 18:13:05,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-11 18:13:05,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:13:05,080 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 16 treesize of output 11 [2024-10-11 18:13:05,102 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:13:05,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-11 18:13:05,105 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 24 treesize of output 11 [2024-10-11 18:13:05,202 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 25 treesize of output 13 [2024-10-11 18:13:05,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-10-11 18:13:05,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:05,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:13:05,317 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_976 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_976) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 4))) (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_976 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_976) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_977) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2024-10-11 18:13:05,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:05,382 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2024-10-11 18:13:05,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:05,388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-10-11 18:13:05,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:05,397 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 52 treesize of output 55 [2024-10-11 18:13:05,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:05,408 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 82 treesize of output 81 [2024-10-11 18:13:05,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 9 [2024-10-11 18:13:05,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 7 [2024-10-11 18:13:05,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:05,444 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-10-11 18:13:05,446 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:13:05,448 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-10-11 18:13:05,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:05,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406145058] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:13:05,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:13:05,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2024-10-11 18:13:05,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442771089] [2024-10-11 18:13:05,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:13:05,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 18:13:05,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:13:05,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 18:13:05,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=509, Unknown=10, NotChecked=46, Total=650 [2024-10-11 18:13:05,527 INFO L87 Difference]: Start difference. First operand 162 states and 186 transitions. Second operand has 26 states, 25 states have (on average 2.88) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:06,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:13:06,284 INFO L93 Difference]: Finished difference Result 199 states and 229 transitions. [2024-10-11 18:13:06,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 18:13:06,284 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.88) internal successors, (72), 26 states have internal predecessors, (72), 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 26 [2024-10-11 18:13:06,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:13:06,285 INFO L225 Difference]: With dead ends: 199 [2024-10-11 18:13:06,285 INFO L226 Difference]: Without dead ends: 199 [2024-10-11 18:13:06,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=1033, Unknown=12, NotChecked=68, Total=1332 [2024-10-11 18:13:06,294 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 304 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:13:06,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 535 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1197 Invalid, 0 Unknown, 155 Unchecked, 0.5s Time] [2024-10-11 18:13:06,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-11 18:13:06,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 184. [2024-10-11 18:13:06,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 159 states have (on average 1.3647798742138364) internal successors, (217), 182 states have internal predecessors, (217), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:06,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 220 transitions. [2024-10-11 18:13:06,298 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 220 transitions. Word has length 26 [2024-10-11 18:13:06,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:13:06,299 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 220 transitions. [2024-10-11 18:13:06,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.88) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:06,299 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 220 transitions. [2024-10-11 18:13:06,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:13:06,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:13:06,300 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, 1, 1, 1, 1, 1, 1] [2024-10-11 18:13:06,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 18:13:06,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-10-11 18:13:06,501 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:13:06,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:13:06,501 INFO L85 PathProgramCache]: Analyzing trace with hash 292433405, now seen corresponding path program 1 times [2024-10-11 18:13:06,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:13:06,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092084921] [2024-10-11 18:13:06,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:06,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:13:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:06,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:13:06,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092084921] [2024-10-11 18:13:06,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092084921] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:13:06,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876351292] [2024-10-11 18:13:06,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:06,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:13:06,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:13:06,610 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:13:06,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 18:13:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:06,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 18:13:06,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:13:06,700 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-10-11 18:13:06,724 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:13:06,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-11 18:13:06,747 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-10-11 18:13:06,766 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 11 [2024-10-11 18:13:06,924 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 25 treesize of output 13 [2024-10-11 18:13:06,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-11 18:13:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:13:06,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:13:07,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:13:07,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876351292] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:13:07,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:13:07,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2024-10-11 18:13:07,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795007536] [2024-10-11 18:13:07,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:13:07,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 18:13:07,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:13:07,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 18:13:07,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:13:07,128 INFO L87 Difference]: Start difference. First operand 184 states and 220 transitions. Second operand has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:07,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:13:07,644 INFO L93 Difference]: Finished difference Result 212 states and 250 transitions. [2024-10-11 18:13:07,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 18:13:07,645 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-11 18:13:07,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:13:07,645 INFO L225 Difference]: With dead ends: 212 [2024-10-11 18:13:07,645 INFO L226 Difference]: Without dead ends: 212 [2024-10-11 18:13:07,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2024-10-11 18:13:07,646 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 290 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:13:07,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 303 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:13:07,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-11 18:13:07,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 195. [2024-10-11 18:13:07,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 170 states have (on average 1.3294117647058823) internal successors, (226), 193 states have internal predecessors, (226), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 229 transitions. [2024-10-11 18:13:07,653 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 229 transitions. Word has length 27 [2024-10-11 18:13:07,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:13:07,653 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 229 transitions. [2024-10-11 18:13:07,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:07,653 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 229 transitions. [2024-10-11 18:13:07,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:13:07,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:13:07,654 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:13:07,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 18:13:07,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:13:07,854 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:13:07,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:13:07,855 INFO L85 PathProgramCache]: Analyzing trace with hash 475500578, now seen corresponding path program 1 times [2024-10-11 18:13:07,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:13:07,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494708842] [2024-10-11 18:13:07,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:07,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:13:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:07,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:13:07,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:13:07,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494708842] [2024-10-11 18:13:07,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494708842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:13:07,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:13:07,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:13:07,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997555795] [2024-10-11 18:13:07,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:13:07,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:13:07,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:13:07,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:13:07,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:13:07,884 INFO L87 Difference]: Start difference. First operand 195 states and 229 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:07,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:13:07,922 INFO L93 Difference]: Finished difference Result 194 states and 227 transitions. [2024-10-11 18:13:07,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:13:07,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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 28 [2024-10-11 18:13:07,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:13:07,923 INFO L225 Difference]: With dead ends: 194 [2024-10-11 18:13:07,923 INFO L226 Difference]: Without dead ends: 194 [2024-10-11 18:13:07,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:13:07,924 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 50 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:13:07,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 54 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:13:07,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-11 18:13:07,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-10-11 18:13:07,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 170 states have (on average 1.3176470588235294) internal successors, (224), 192 states have internal predecessors, (224), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:07,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 227 transitions. [2024-10-11 18:13:07,927 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 227 transitions. Word has length 28 [2024-10-11 18:13:07,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:13:07,928 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 227 transitions. [2024-10-11 18:13:07,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:07,928 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 227 transitions. [2024-10-11 18:13:07,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:13:07,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:13:07,928 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:13:07,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 18:13:07,928 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:13:07,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:13:07,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1689530661, now seen corresponding path program 1 times [2024-10-11 18:13:07,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:13:07,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165581141] [2024-10-11 18:13:07,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:07,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:13:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:08,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:13:08,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:13:08,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165581141] [2024-10-11 18:13:08,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165581141] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:13:08,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883446288] [2024-10-11 18:13:08,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:08,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:13:08,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:13:08,103 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:13:08,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 18:13:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:08,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 18:13:08,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:13:08,232 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:13:08,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 27 [2024-10-11 18:13:08,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 16 treesize of output 29 [2024-10-11 18:13:08,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 21 treesize of output 37 [2024-10-11 18:13:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:13:08,452 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:13:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:13:08,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883446288] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:13:08,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:13:08,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-10-11 18:13:08,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717008515] [2024-10-11 18:13:08,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:13:08,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 18:13:08,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:13:08,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 18:13:08,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:13:08,588 INFO L87 Difference]: Start difference. First operand 194 states and 227 transitions. Second operand has 14 states, 13 states have (on average 6.0) internal successors, (78), 13 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-10-11 18:13:08,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:13:08,773 INFO L93 Difference]: Finished difference Result 203 states and 235 transitions. [2024-10-11 18:13:08,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:13:08,773 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.0) internal successors, (78), 13 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) Word has length 30 [2024-10-11 18:13:08,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:13:08,774 INFO L225 Difference]: With dead ends: 203 [2024-10-11 18:13:08,774 INFO L226 Difference]: Without dead ends: 180 [2024-10-11 18:13:08,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:13:08,774 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 14 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:13:08,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 230 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:13:08,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-11 18:13:08,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-10-11 18:13:08,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 156 states have (on average 1.3397435897435896) internal successors, (209), 178 states have internal predecessors, (209), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:08,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 212 transitions. [2024-10-11 18:13:08,781 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 212 transitions. Word has length 30 [2024-10-11 18:13:08,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:13:08,781 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 212 transitions. [2024-10-11 18:13:08,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.0) internal successors, (78), 13 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-10-11 18:13:08,781 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 212 transitions. [2024-10-11 18:13:08,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:13:08,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:13:08,782 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, 1, 1, 1] [2024-10-11 18:13:08,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 18:13:08,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-11 18:13:08,982 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2024-10-11 18:13:08,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:13:08,983 INFO L85 PathProgramCache]: Analyzing trace with hash 650974719, now seen corresponding path program 2 times [2024-10-11 18:13:08,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:13:08,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649495545] [2024-10-11 18:13:08,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:08,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:13:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:09,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:09,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:13:09,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649495545] [2024-10-11 18:13:09,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649495545] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:13:09,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145874102] [2024-10-11 18:13:09,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:13:09,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:13:09,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:13:09,341 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:13:09,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 18:13:09,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:13:09,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:13:09,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-11 18:13:09,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:13:09,457 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-10-11 18:13:09,481 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:13:09,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-11 18:13:09,565 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2024-10-11 18:13:09,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 28 [2024-10-11 18:13:09,611 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-10-11 18:13:09,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-10-11 18:13:09,697 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:13:09,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-11 18:13:09,715 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 18:13:09,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2024-10-11 18:13:09,770 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:13:09,770 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 1 case distinctions, treesize of input 63 treesize of output 44 [2024-10-11 18:13:09,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:13:09,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-11 18:13:09,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-10-11 18:13:10,097 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:13:10,098 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 53 treesize of output 24 [2024-10-11 18:13:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:10,132 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:13:10,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:10,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 48997 treesize of output 45697 [2024-10-11 18:13:11,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:11,764 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 3770 treesize of output 3610 [2024-10-11 18:13:11,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:11,842 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 3875 treesize of output 3798 [2024-10-11 18:13:11,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3756 treesize of output 3714