./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-properties/alternating_list-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/alternating_list-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 941f3dd0e4566f414ae914eed10af26405f8e9f2f3d427c146090b07336d2fc2 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:59:51,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:59:51,966 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:59:51,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:59:51,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:59:52,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:59:52,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:59:52,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:59:52,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:59:52,010 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:59:52,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:59:52,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:59:52,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:59:52,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:59:52,014 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:59:52,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:59:52,014 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:59:52,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:59:52,015 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:59:52,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:59:52,015 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:59:52,017 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:59:52,018 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:59:52,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:59:52,018 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:59:52,018 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:59:52,018 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:59:52,019 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:59:52,019 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:59:52,019 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:59:52,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:59:52,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:59:52,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:59:52,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:59:52,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:59:52,020 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:59:52,020 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:59:52,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:59:52,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:59:52,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:59:52,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:59:52,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:59:52,022 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 941f3dd0e4566f414ae914eed10af26405f8e9f2f3d427c146090b07336d2fc2 [2024-11-09 07:59:52,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:59:52,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:59:52,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:59:52,298 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:59:52,299 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:59:52,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/alternating_list-1.i [2024-11-09 07:59:53,771 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:59:54,023 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:59:54,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/alternating_list-1.i [2024-11-09 07:59:54,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/993f7cb23/c45a4c3b900d4428b26fab4d7cb74cc0/FLAG343be02ca [2024-11-09 07:59:54,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/993f7cb23/c45a4c3b900d4428b26fab4d7cb74cc0 [2024-11-09 07:59:54,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:59:54,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:59:54,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:59:54,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:59:54,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:59:54,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:59:54" (1/1) ... [2024-11-09 07:59:54,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21adf94a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:54, skipping insertion in model container [2024-11-09 07:59:54,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:59:54" (1/1) ... [2024-11-09 07:59:54,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:59:54,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:59:54,774 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:59:54,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:59:54,843 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:59:54,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:54 WrapperNode [2024-11-09 07:59:54,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:59:54,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:59:54,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:59:54,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:59:54,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:54" (1/1) ... [2024-11-09 07:59:54,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:54" (1/1) ... [2024-11-09 07:59:54,885 INFO L138 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 94 [2024-11-09 07:59:54,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:59:54,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:59:54,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:59:54,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:59:54,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:54" (1/1) ... [2024-11-09 07:59:54,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:54" (1/1) ... [2024-11-09 07:59:54,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:54" (1/1) ... [2024-11-09 07:59:54,914 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-11-09 07:59:54,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:54" (1/1) ... [2024-11-09 07:59:54,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:54" (1/1) ... [2024-11-09 07:59:54,920 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:54" (1/1) ... [2024-11-09 07:59:54,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:54" (1/1) ... [2024-11-09 07:59:54,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:54" (1/1) ... [2024-11-09 07:59:54,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:54" (1/1) ... [2024-11-09 07:59:54,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:59:54,930 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:59:54,930 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:59:54,930 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:59:54,931 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:54" (1/1) ... [2024-11-09 07:59:54,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:59:54,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:59:54,962 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:59:54,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:59:55,004 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-09 07:59:55,005 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-09 07:59:55,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:59:55,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:59:55,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:59:55,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:59:55,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:59:55,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:59:55,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:59:55,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:59:55,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:59:55,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:59:55,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:59:55,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:59:55,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:59:55,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:59:55,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:59:55,115 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:59:55,118 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:59:55,146 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-09 07:59:55,398 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-09 07:59:55,399 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:59:55,414 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:59:55,415 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 07:59:55,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:59:55 BoogieIcfgContainer [2024-11-09 07:59:55,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:59:55,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:59:55,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:59:55,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:59:55,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:59:54" (1/3) ... [2024-11-09 07:59:55,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6057c708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:59:55, skipping insertion in model container [2024-11-09 07:59:55,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:54" (2/3) ... [2024-11-09 07:59:55,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6057c708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:59:55, skipping insertion in model container [2024-11-09 07:59:55,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:59:55" (3/3) ... [2024-11-09 07:59:55,424 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list-1.i [2024-11-09 07:59:55,436 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:59:55,436 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-11-09 07:59:55,475 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:59:55,480 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;@4a3c2503, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:59:55,480 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2024-11-09 07:59:55,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 46 states have (on average 1.934782608695652) internal successors, (89), 77 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:55,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:59:55,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:55,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:59:55,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-11-09 07:59:55,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:55,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1037517576, now seen corresponding path program 1 times [2024-11-09 07:59:55,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:55,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226645439] [2024-11-09 07:59:55,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:55,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:55,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:55,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:55,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226645439] [2024-11-09 07:59:55,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226645439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:55,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:55,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:59:55,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516276677] [2024-11-09 07:59:55,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:55,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 07:59:55,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:55,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 07:59:55,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:59:55,701 INFO L87 Difference]: Start difference. First operand has 79 states, 46 states have (on average 1.934782608695652) internal successors, (89), 77 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:55,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:55,722 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2024-11-09 07:59:55,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 07:59:55,724 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2024-11-09 07:59:55,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:55,730 INFO L225 Difference]: With dead ends: 78 [2024-11-09 07:59:55,731 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 07:59:55,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:59:55,737 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:55,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:59:55,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 07:59:55,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-09 07:59:55,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2024-11-09 07:59:55,773 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 6 [2024-11-09 07:59:55,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:55,773 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2024-11-09 07:59:55,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:55,773 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2024-11-09 07:59:55,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:59:55,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:55,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:55,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:59:55,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-11-09 07:59:55,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:55,775 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238131, now seen corresponding path program 1 times [2024-11-09 07:59:55,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:55,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180191164] [2024-11-09 07:59:55,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:55,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:55,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:55,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180191164] [2024-11-09 07:59:55,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180191164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:55,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:55,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:59:55,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908317009] [2024-11-09 07:59:55,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:55,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:59:55,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:55,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:59:55,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:59:55,945 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:56,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:56,130 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2024-11-09 07:59:56,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:59:56,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 07:59:56,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:56,132 INFO L225 Difference]: With dead ends: 73 [2024-11-09 07:59:56,132 INFO L226 Difference]: Without dead ends: 73 [2024-11-09 07:59:56,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:59:56,135 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 87 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:56,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 52 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:59:56,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-09 07:59:56,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-09 07:59:56,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.7) internal successors, (85), 72 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2024-11-09 07:59:56,149 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 7 [2024-11-09 07:59:56,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:56,150 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2024-11-09 07:59:56,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:56,151 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2024-11-09 07:59:56,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:59:56,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:56,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:56,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:59:56,152 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-11-09 07:59:56,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:56,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238132, now seen corresponding path program 1 times [2024-11-09 07:59:56,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:56,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405016767] [2024-11-09 07:59:56,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:56,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:56,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:56,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:56,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405016767] [2024-11-09 07:59:56,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405016767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:56,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:56,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:59:56,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547132423] [2024-11-09 07:59:56,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:56,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:59:56,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:56,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:59:56,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:59:56,366 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:56,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:56,486 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2024-11-09 07:59:56,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:59:56,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 07:59:56,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:56,488 INFO L225 Difference]: With dead ends: 94 [2024-11-09 07:59:56,488 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 07:59:56,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:59:56,489 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 99 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:56,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 84 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:56,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 07:59:56,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2024-11-09 07:59:56,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.5303030303030303) internal successors, (101), 88 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:56,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2024-11-09 07:59:56,496 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 7 [2024-11-09 07:59:56,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:56,497 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2024-11-09 07:59:56,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:56,497 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2024-11-09 07:59:56,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:59:56,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:56,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:56,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:59:56,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-11-09 07:59:56,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:56,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1862079005, now seen corresponding path program 1 times [2024-11-09 07:59:56,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:56,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452814623] [2024-11-09 07:59:56,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:56,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:56,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:56,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452814623] [2024-11-09 07:59:56,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452814623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:56,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:56,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:59:56,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896025873] [2024-11-09 07:59:56,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:56,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:59:56,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:56,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:59:56,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:59:56,601 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-11-09 07:59:56,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:56,688 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2024-11-09 07:59:56,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:59:56,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-11-09 07:59:56,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:56,689 INFO L225 Difference]: With dead ends: 95 [2024-11-09 07:59:56,689 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 07:59:56,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:59:56,691 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 91 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:56,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 90 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:56,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 07:59:56,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2024-11-09 07:59:56,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 89 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2024-11-09 07:59:56,703 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 15 [2024-11-09 07:59:56,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:56,703 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2024-11-09 07:59:56,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-11-09 07:59:56,703 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2024-11-09 07:59:56,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:59:56,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:56,704 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:56,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:59:56,705 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-11-09 07:59:56,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:56,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1889920183, now seen corresponding path program 1 times [2024-11-09 07:59:56,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:56,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582288249] [2024-11-09 07:59:56,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:56,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:56,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:56,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:56,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582288249] [2024-11-09 07:59:56,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582288249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:56,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:56,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:59:56,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033834161] [2024-11-09 07:59:56,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:56,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:59:56,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:56,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:59:56,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:59:56,861 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:57,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:57,051 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2024-11-09 07:59:57,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:59:57,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 16 [2024-11-09 07:59:57,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:57,053 INFO L225 Difference]: With dead ends: 101 [2024-11-09 07:59:57,053 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 07:59:57,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:59:57,054 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 34 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:57,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 266 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:57,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 07:59:57,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2024-11-09 07:59:57,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 95 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:57,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2024-11-09 07:59:57,067 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 16 [2024-11-09 07:59:57,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:57,068 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2024-11-09 07:59:57,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:57,068 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2024-11-09 07:59:57,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:59:57,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:57,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:57,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:59:57,072 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-11-09 07:59:57,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:57,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1543433365, now seen corresponding path program 1 times [2024-11-09 07:59:57,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:57,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444411583] [2024-11-09 07:59:57,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:57,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:57,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:57,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444411583] [2024-11-09 07:59:57,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444411583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:57,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:57,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:59:57,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873346383] [2024-11-09 07:59:57,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:57,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:59:57,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:57,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:59:57,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:59:57,210 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:57,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:57,309 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2024-11-09 07:59:57,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:59:57,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 07:59:57,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:57,315 INFO L225 Difference]: With dead ends: 103 [2024-11-09 07:59:57,315 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 07:59:57,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:59:57,316 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 18 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:57,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 168 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:57,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 07:59:57,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 07:59:57,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 91 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:57,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2024-11-09 07:59:57,322 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 17 [2024-11-09 07:59:57,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:57,322 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2024-11-09 07:59:57,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:57,322 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2024-11-09 07:59:57,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:59:57,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:57,323 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:57,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:59:57,323 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-11-09 07:59:57,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:57,324 INFO L85 PathProgramCache]: Analyzing trace with hash -242637466, now seen corresponding path program 1 times [2024-11-09 07:59:57,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:57,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980239430] [2024-11-09 07:59:57,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:57,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:57,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:57,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:57,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980239430] [2024-11-09 07:59:57,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980239430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:57,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:57,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:59:57,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540505947] [2024-11-09 07:59:57,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:57,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:59:57,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:57,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:59:57,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:59:57,368 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:57,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:57,379 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2024-11-09 07:59:57,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:59:57,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 07:59:57,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:57,381 INFO L225 Difference]: With dead ends: 140 [2024-11-09 07:59:57,381 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 07:59:57,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-09 07:59:57,382 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 47 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:57,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 155 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:59:57,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 07:59:57,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 101. [2024-11-09 07:59:57,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 100 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:57,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2024-11-09 07:59:57,396 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 17 [2024-11-09 07:59:57,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:57,396 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2024-11-09 07:59:57,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2024-11-09 07:59:57,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:59:57,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:57,397 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:57,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:59:57,397 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-11-09 07:59:57,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:57,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1088042016, now seen corresponding path program 1 times [2024-11-09 07:59:57,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:57,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107894064] [2024-11-09 07:59:57,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:57,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:57,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:57,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107894064] [2024-11-09 07:59:57,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107894064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:57,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:57,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:59:57,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868490714] [2024-11-09 07:59:57,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:57,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:59:57,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:57,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:59:57,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:59:57,502 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:57,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:57,625 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2024-11-09 07:59:57,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:59:57,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 07:59:57,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:57,627 INFO L225 Difference]: With dead ends: 98 [2024-11-09 07:59:57,627 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 07:59:57,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:59:57,628 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 27 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:57,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 152 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:57,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 07:59:57,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-09 07:59:57,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 97 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:57,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 113 transitions. [2024-11-09 07:59:57,632 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 113 transitions. Word has length 17 [2024-11-09 07:59:57,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:57,633 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 113 transitions. [2024-11-09 07:59:57,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:57,633 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2024-11-09 07:59:57,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:59:57,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:57,634 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:57,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:59:57,634 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-11-09 07:59:57,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:57,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1088042017, now seen corresponding path program 1 times [2024-11-09 07:59:57,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:57,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453351443] [2024-11-09 07:59:57,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:57,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:57,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:57,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:57,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453351443] [2024-11-09 07:59:57,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453351443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:57,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:57,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:59:57,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602259788] [2024-11-09 07:59:57,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:57,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:59:57,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:57,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:59:57,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:59:57,849 INFO L87 Difference]: Start difference. First operand 98 states and 113 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:58,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:58,002 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2024-11-09 07:59:58,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:59:58,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 07:59:58,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:58,004 INFO L225 Difference]: With dead ends: 93 [2024-11-09 07:59:58,004 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 07:59:58,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:59:58,006 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 9 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:58,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 202 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:58,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 07:59:58,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2024-11-09 07:59:58,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 85 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:58,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2024-11-09 07:59:58,016 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 17 [2024-11-09 07:59:58,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:58,017 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2024-11-09 07:59:58,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:58,017 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2024-11-09 07:59:58,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:59:58,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:58,022 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-11-09 07:59:58,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:59:58,022 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-11-09 07:59:58,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:58,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1281138845, now seen corresponding path program 1 times [2024-11-09 07:59:58,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:58,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597694011] [2024-11-09 07:59:58,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:58,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:58,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:58,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597694011] [2024-11-09 07:59:58,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597694011] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:59:58,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660859513] [2024-11-09 07:59:58,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:58,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:59:58,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:59:58,420 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:59:58,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:59:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:58,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 07:59:58,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:59:58,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:59:58,689 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:59:58,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:59:58,731 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 19 treesize of output 1 [2024-11-09 07:59:58,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:59:58,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 07:59:58,752 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 20 treesize of output 8 [2024-11-09 07:59:58,793 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-11-09 07:59:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:58,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:59:58,881 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_127 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_127) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2024-11-09 07:59:58,889 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_127 (Array Int Int))) (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_127) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2024-11-09 07:59:58,918 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_127 (Array Int Int)) (v_ArrVal_125 (Array Int Int))) (or (not (= v_ArrVal_125 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_125 .cse0))))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_125) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_127) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2024-11-09 07:59:59,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:59,017 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 70 treesize of output 74 [2024-11-09 07:59:59,026 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 50 treesize of output 46 [2024-11-09 07:59:59,060 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 07:59:59,061 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-11-09 07:59:59,117 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 102 treesize of output 98 [2024-11-09 07:59:59,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:59,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660859513] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:59:59,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:59:59,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 19 [2024-11-09 07:59:59,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462833731] [2024-11-09 07:59:59,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:59:59,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 07:59:59,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:59,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 07:59:59,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=188, Unknown=9, NotChecked=90, Total=342 [2024-11-09 07:59:59,145 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:59,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:59,706 INFO L93 Difference]: Finished difference Result 215 states and 235 transitions. [2024-11-09 07:59:59,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 07:59:59,706 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 07:59:59,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:59,708 INFO L225 Difference]: With dead ends: 215 [2024-11-09 07:59:59,708 INFO L226 Difference]: Without dead ends: 215 [2024-11-09 07:59:59,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=12, NotChecked=150, Total=812 [2024-11-09 07:59:59,709 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 187 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 564 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:59,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 636 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 493 Invalid, 0 Unknown, 564 Unchecked, 0.3s Time] [2024-11-09 07:59:59,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-09 07:59:59,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 103. [2024-11-09 07:59:59,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 102 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:59,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2024-11-09 07:59:59,715 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 26 [2024-11-09 07:59:59,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:59,715 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2024-11-09 07:59:59,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2024-11-09 07:59:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:59:59,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:59,716 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-11-09 07:59:59,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:59:59,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 07:59:59,918 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2024-11-09 07:59:59,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:59,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1281158610, now seen corresponding path program 1 times [2024-11-09 07:59:59,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:59,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799355852] [2024-11-09 07:59:59,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:59,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:00:00,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:00:00,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:00:00,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799355852] [2024-11-09 08:00:00,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799355852] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:00:00,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130331543] [2024-11-09 08:00:00,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:00:00,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:00:00,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:00:00,389 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:00:00,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 08:00:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:00:00,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 08:00:00,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:00:00,569 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 08:00:00,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 08:00:00,624 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 19 treesize of output 1 [2024-11-09 08:00:00,764 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 08:00:00,764 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 42 treesize of output 41 [2024-11-09 08:00:00,861 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 31 treesize of output 13 [2024-11-09 08:00:00,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:00:00,935 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:00:01,041 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_174 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2024-11-09 08:00:01,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:00:01,097 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 24 treesize of output 25 [2024-11-09 08:00:01,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:00:01,106 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 40 treesize of output 39 [2024-11-09 08:00:01,130 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 5 [2024-11-09 08:00:02,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:00:02,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 150 treesize of output 748