./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-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 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:54:59,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:54:59,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 10:54:59,842 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:54:59,843 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:54:59,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:54:59,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:54:59,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:54:59,867 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:54:59,869 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:54:59,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:54:59,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:54:59,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:54:59,872 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:54:59,872 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:54:59,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:54:59,873 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:54:59,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:54:59,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:54:59,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:54:59,874 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:54:59,877 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:54:59,877 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:54:59,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:54:59,878 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:54:59,878 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:54:59,878 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:54:59,879 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:54:59,879 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:54:59,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:54:59,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:54:59,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:54:59,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:54:59,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:54:59,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:54:59,881 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:54:59,881 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:54:59,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:54:59,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:54:59,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:54:59,882 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:54:59,883 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:54:59,883 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 -> 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 [2024-10-13 10:55:00,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:55:00,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:55:00,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:55:00,160 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:55:00,161 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:55:00,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2024-10-13 10:55:01,605 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:55:01,849 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:55:01,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2024-10-13 10:55:01,866 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f19865a1/0bc7425c7f2d46c78130d6f106f80a85/FLAG96ba57642 [2024-10-13 10:55:02,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f19865a1/0bc7425c7f2d46c78130d6f106f80a85 [2024-10-13 10:55:02,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:55:02,181 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:55:02,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:55:02,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:55:02,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:55:02,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:55:02" (1/1) ... [2024-10-13 10:55:02,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@181e3abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:02, skipping insertion in model container [2024-10-13 10:55:02,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:55:02" (1/1) ... [2024-10-13 10:55:02,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:55:02,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:55:02,578 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:55:02,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:55:02,672 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:55:02,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:02 WrapperNode [2024-10-13 10:55:02,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:55:02,675 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:55:02,675 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:55:02,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:55:02,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:02" (1/1) ... [2024-10-13 10:55:02,696 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:02" (1/1) ... [2024-10-13 10:55:02,721 INFO L138 Inliner]: procedures = 119, calls = 50, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 166 [2024-10-13 10:55:02,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:55:02,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:55:02,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:55:02,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:55:02,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:02" (1/1) ... [2024-10-13 10:55:02,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:02" (1/1) ... [2024-10-13 10:55:02,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:02" (1/1) ... [2024-10-13 10:55:02,763 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2024-10-13 10:55:02,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:02" (1/1) ... [2024-10-13 10:55:02,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:02" (1/1) ... [2024-10-13 10:55:02,773 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:02" (1/1) ... [2024-10-13 10:55:02,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:02" (1/1) ... [2024-10-13 10:55:02,784 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:02" (1/1) ... [2024-10-13 10:55:02,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:02" (1/1) ... [2024-10-13 10:55:02,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:55:02,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:55:02,792 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:55:02,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:55:02,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:02" (1/1) ... [2024-10-13 10:55:02,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:55:02,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:55:02,829 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-10-13 10:55:02,832 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-10-13 10:55:02,890 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-13 10:55:02,891 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-13 10:55:02,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 10:55:02,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 10:55:02,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 10:55:02,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 10:55:02,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:55:02,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:55:02,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:55:02,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:55:02,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:55:02,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:55:02,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:55:02,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 10:55:02,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 10:55:02,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:55:02,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:55:03,040 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:55:03,044 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:55:03,574 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2024-10-13 10:55:03,574 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:55:03,643 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:55:03,645 INFO L314 CfgBuilder]: Removed 17 assume(true) statements. [2024-10-13 10:55:03,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:55:03 BoogieIcfgContainer [2024-10-13 10:55:03,646 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:55:03,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:55:03,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:55:03,653 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:55:03,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:55:02" (1/3) ... [2024-10-13 10:55:03,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b3c3c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:55:03, skipping insertion in model container [2024-10-13 10:55:03,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:02" (2/3) ... [2024-10-13 10:55:03,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b3c3c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:55:03, skipping insertion in model container [2024-10-13 10:55:03,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:55:03" (3/3) ... [2024-10-13 10:55:03,657 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2024-10-13 10:55:03,676 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:55:03,677 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 71 error locations. [2024-10-13 10:55:03,732 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:55:03,738 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;@1331eaa7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:55:03,738 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2024-10-13 10:55:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 154 states, 74 states have (on average 2.3783783783783785) internal successors, (176), 145 states have internal predecessors, (176), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 10:55:03,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 10:55:03,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:03,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 10:55:03,748 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:03,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:03,752 INFO L85 PathProgramCache]: Analyzing trace with hash 11638, now seen corresponding path program 1 times [2024-10-13 10:55:03,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:03,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382460595] [2024-10-13 10:55:03,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:03,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:03,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:03,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:03,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382460595] [2024-10-13 10:55:03,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382460595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:03,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:03,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:55:03,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490114363] [2024-10-13 10:55:03,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:03,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:55:03,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:03,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:55:03,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:03,994 INFO L87 Difference]: Start difference. First operand has 154 states, 74 states have (on average 2.3783783783783785) internal successors, (176), 145 states have internal predecessors, (176), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:04,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:04,193 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2024-10-13 10:55:04,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:55:04,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 10:55:04,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:04,227 INFO L225 Difference]: With dead ends: 165 [2024-10-13 10:55:04,227 INFO L226 Difference]: Without dead ends: 164 [2024-10-13 10:55:04,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:04,233 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 122 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:04,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 96 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:04,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-13 10:55:04,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 141. [2024-10-13 10:55:04,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 66 states have (on average 2.196969696969697) internal successors, (145), 139 states have internal predecessors, (145), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:04,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2024-10-13 10:55:04,310 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 2 [2024-10-13 10:55:04,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:04,310 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2024-10-13 10:55:04,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:04,311 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2024-10-13 10:55:04,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 10:55:04,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:04,311 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 10:55:04,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:55:04,312 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:04,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:04,313 INFO L85 PathProgramCache]: Analyzing trace with hash 11639, now seen corresponding path program 1 times [2024-10-13 10:55:04,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:04,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042290125] [2024-10-13 10:55:04,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:04,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:04,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:04,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:04,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042290125] [2024-10-13 10:55:04,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042290125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:04,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:04,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:55:04,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811687533] [2024-10-13 10:55:04,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:04,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:55:04,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:04,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:55:04,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:04,413 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:04,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:04,567 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2024-10-13 10:55:04,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:55:04,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 10:55:04,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:04,570 INFO L225 Difference]: With dead ends: 138 [2024-10-13 10:55:04,570 INFO L226 Difference]: Without dead ends: 138 [2024-10-13 10:55:04,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:04,571 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 133 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:04,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 82 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:04,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-13 10:55:04,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-10-13 10:55:04,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 66 states have (on average 2.1515151515151514) internal successors, (142), 136 states have internal predecessors, (142), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2024-10-13 10:55:04,588 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 2 [2024-10-13 10:55:04,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:04,589 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2024-10-13 10:55:04,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2024-10-13 10:55:04,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:55:04,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:04,590 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:55:04,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:55:04,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:04,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:04,595 INFO L85 PathProgramCache]: Analyzing trace with hash 346702845, now seen corresponding path program 1 times [2024-10-13 10:55:04,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:04,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297555573] [2024-10-13 10:55:04,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:04,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:04,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:04,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:04,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297555573] [2024-10-13 10:55:04,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297555573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:04,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:04,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:55:04,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671156344] [2024-10-13 10:55:04,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:04,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:55:04,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:04,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:55:04,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:04,734 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:04,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:04,868 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2024-10-13 10:55:04,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:55:04,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-10-13 10:55:04,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:04,870 INFO L225 Difference]: With dead ends: 133 [2024-10-13 10:55:04,870 INFO L226 Difference]: Without dead ends: 133 [2024-10-13 10:55:04,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:04,871 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 104 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:04,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 85 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:04,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-13 10:55:04,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-10-13 10:55:04,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 68 states have (on average 2.0441176470588234) internal successors, (139), 131 states have internal predecessors, (139), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:04,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2024-10-13 10:55:04,890 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 5 [2024-10-13 10:55:04,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:04,890 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2024-10-13 10:55:04,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:04,894 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2024-10-13 10:55:04,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:55:04,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:04,894 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:55:04,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:55:04,895 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:04,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:04,896 INFO L85 PathProgramCache]: Analyzing trace with hash 346702846, now seen corresponding path program 1 times [2024-10-13 10:55:04,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:04,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640267296] [2024-10-13 10:55:04,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:04,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:05,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:05,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:05,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640267296] [2024-10-13 10:55:05,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640267296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:05,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:05,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:55:05,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633162265] [2024-10-13 10:55:05,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:05,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:55:05,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:05,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:55:05,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:05,024 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:05,135 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2024-10-13 10:55:05,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:55:05,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-10-13 10:55:05,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:05,137 INFO L225 Difference]: With dead ends: 135 [2024-10-13 10:55:05,137 INFO L226 Difference]: Without dead ends: 135 [2024-10-13 10:55:05,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:05,139 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 98 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:05,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 97 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:05,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-13 10:55:05,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-10-13 10:55:05,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 133 states have internal predecessors, (141), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:05,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 148 transitions. [2024-10-13 10:55:05,147 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 148 transitions. Word has length 5 [2024-10-13 10:55:05,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:05,147 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 148 transitions. [2024-10-13 10:55:05,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:05,147 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 148 transitions. [2024-10-13 10:55:05,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:55:05,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:05,148 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:05,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:55:05,148 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:05,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:05,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1246338220, now seen corresponding path program 1 times [2024-10-13 10:55:05,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:05,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630506088] [2024-10-13 10:55:05,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:05,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:05,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:05,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:05,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630506088] [2024-10-13 10:55:05,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630506088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:05,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:05,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:55:05,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364946488] [2024-10-13 10:55:05,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:05,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:55:05,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:05,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:55:05,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:55:05,342 INFO L87 Difference]: Start difference. First operand 135 states and 148 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:05,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:05,566 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2024-10-13 10:55:05,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:55:05,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 10:55:05,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:05,567 INFO L225 Difference]: With dead ends: 122 [2024-10-13 10:55:05,567 INFO L226 Difference]: Without dead ends: 122 [2024-10-13 10:55:05,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:05,569 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 135 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:05,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 70 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:05,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-13 10:55:05,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-13 10:55:05,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 75 states have (on average 1.7333333333333334) internal successors, (130), 120 states have internal predecessors, (130), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:05,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 137 transitions. [2024-10-13 10:55:05,582 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 137 transitions. Word has length 10 [2024-10-13 10:55:05,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:05,582 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 137 transitions. [2024-10-13 10:55:05,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:05,583 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 137 transitions. [2024-10-13 10:55:05,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:55:05,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:05,585 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:05,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:55:05,585 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:05,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:05,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1246338221, now seen corresponding path program 1 times [2024-10-13 10:55:05,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:05,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976843243] [2024-10-13 10:55:05,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:05,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:05,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:05,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976843243] [2024-10-13 10:55:05,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976843243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:05,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:05,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:55:05,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007185181] [2024-10-13 10:55:05,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:05,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:55:05,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:05,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:55:05,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:55:05,820 INFO L87 Difference]: Start difference. First operand 122 states and 137 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:06,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:06,011 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2024-10-13 10:55:06,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:55:06,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 10:55:06,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:06,017 INFO L225 Difference]: With dead ends: 133 [2024-10-13 10:55:06,018 INFO L226 Difference]: Without dead ends: 133 [2024-10-13 10:55:06,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:06,019 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 114 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:06,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 110 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:06,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-13 10:55:06,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2024-10-13 10:55:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 84 states have (on average 1.6785714285714286) internal successors, (141), 128 states have internal predecessors, (141), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:06,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2024-10-13 10:55:06,028 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 10 [2024-10-13 10:55:06,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:06,028 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2024-10-13 10:55:06,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:06,028 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2024-10-13 10:55:06,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:55:06,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:06,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:06,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:55:06,030 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:06,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:06,030 INFO L85 PathProgramCache]: Analyzing trace with hash -564564076, now seen corresponding path program 1 times [2024-10-13 10:55:06,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:06,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225891436] [2024-10-13 10:55:06,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:06,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:06,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:06,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:06,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225891436] [2024-10-13 10:55:06,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225891436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:06,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:06,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:55:06,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80921656] [2024-10-13 10:55:06,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:06,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:55:06,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:06,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:55:06,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:06,175 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:06,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:06,324 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2024-10-13 10:55:06,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:55:06,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2024-10-13 10:55:06,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:06,326 INFO L225 Difference]: With dead ends: 129 [2024-10-13 10:55:06,326 INFO L226 Difference]: Without dead ends: 129 [2024-10-13 10:55:06,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:55:06,327 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 3 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:06,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 300 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:06,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-13 10:55:06,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-10-13 10:55:06,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 84 states have (on average 1.6547619047619047) internal successors, (139), 127 states have internal predecessors, (139), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:06,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 146 transitions. [2024-10-13 10:55:06,336 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 146 transitions. Word has length 12 [2024-10-13 10:55:06,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:06,336 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 146 transitions. [2024-10-13 10:55:06,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:06,336 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 146 transitions. [2024-10-13 10:55:06,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:55:06,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:06,337 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:06,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:55:06,337 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:06,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:06,338 INFO L85 PathProgramCache]: Analyzing trace with hash -564564075, now seen corresponding path program 1 times [2024-10-13 10:55:06,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:06,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484138947] [2024-10-13 10:55:06,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:06,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:06,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:06,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484138947] [2024-10-13 10:55:06,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484138947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:06,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:06,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:55:06,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71118104] [2024-10-13 10:55:06,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:06,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:55:06,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:06,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:55:06,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:06,561 INFO L87 Difference]: Start difference. First operand 129 states and 146 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:06,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:06,720 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2024-10-13 10:55:06,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:55:06,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2024-10-13 10:55:06,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:06,722 INFO L225 Difference]: With dead ends: 128 [2024-10-13 10:55:06,722 INFO L226 Difference]: Without dead ends: 128 [2024-10-13 10:55:06,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:55:06,723 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 2 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:06,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 283 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:06,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-13 10:55:06,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-10-13 10:55:06,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 84 states have (on average 1.630952380952381) internal successors, (137), 126 states have internal predecessors, (137), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:06,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2024-10-13 10:55:06,731 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 12 [2024-10-13 10:55:06,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:06,732 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2024-10-13 10:55:06,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:06,732 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2024-10-13 10:55:06,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:55:06,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:06,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:06,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:55:06,733 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:06,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:06,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1600003297, now seen corresponding path program 1 times [2024-10-13 10:55:06,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:06,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981744004] [2024-10-13 10:55:06,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:06,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:06,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:06,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:06,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981744004] [2024-10-13 10:55:06,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981744004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:06,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:06,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:55:06,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837715176] [2024-10-13 10:55:06,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:06,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:55:06,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:06,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:55:06,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:06,866 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:07,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:07,055 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2024-10-13 10:55:07,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:55:07,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-13 10:55:07,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:07,057 INFO L225 Difference]: With dead ends: 159 [2024-10-13 10:55:07,057 INFO L226 Difference]: Without dead ends: 159 [2024-10-13 10:55:07,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:55:07,058 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 233 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:07,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 140 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:07,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-13 10:55:07,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 127. [2024-10-13 10:55:07,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 84 states have (on average 1.5952380952380953) internal successors, (134), 125 states have internal predecessors, (134), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 140 transitions. [2024-10-13 10:55:07,066 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 140 transitions. Word has length 14 [2024-10-13 10:55:07,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:07,067 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 140 transitions. [2024-10-13 10:55:07,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2024-10-13 10:55:07,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:55:07,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:07,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:07,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:55:07,069 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:07,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:07,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1379912389, now seen corresponding path program 1 times [2024-10-13 10:55:07,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:07,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352634991] [2024-10-13 10:55:07,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:07,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:07,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:07,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:07,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352634991] [2024-10-13 10:55:07,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352634991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:07,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:07,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:55:07,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292916136] [2024-10-13 10:55:07,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:07,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:55:07,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:07,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:55:07,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:55:07,298 INFO L87 Difference]: Start difference. First operand 127 states and 140 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:07,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:07,636 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2024-10-13 10:55:07,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:55:07,637 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 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 14 [2024-10-13 10:55:07,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:07,638 INFO L225 Difference]: With dead ends: 126 [2024-10-13 10:55:07,638 INFO L226 Difference]: Without dead ends: 126 [2024-10-13 10:55:07,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:55:07,639 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 127 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:07,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 205 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:55:07,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-13 10:55:07,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-10-13 10:55:07,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 84 states have (on average 1.5833333333333333) internal successors, (133), 124 states have internal predecessors, (133), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:07,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 139 transitions. [2024-10-13 10:55:07,645 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 139 transitions. Word has length 14 [2024-10-13 10:55:07,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:07,645 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 139 transitions. [2024-10-13 10:55:07,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:07,645 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 139 transitions. [2024-10-13 10:55:07,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:55:07,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:07,647 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:07,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 10:55:07,647 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:07,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:07,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1379912388, now seen corresponding path program 1 times [2024-10-13 10:55:07,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:07,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616337716] [2024-10-13 10:55:07,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:07,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:07,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:07,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:07,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616337716] [2024-10-13 10:55:07,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616337716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:07,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:07,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:55:07,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208955431] [2024-10-13 10:55:07,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:07,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:55:07,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:07,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:55:07,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:55:07,996 INFO L87 Difference]: Start difference. First operand 126 states and 139 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:08,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:08,491 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2024-10-13 10:55:08,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:55:08,491 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 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 14 [2024-10-13 10:55:08,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:08,492 INFO L225 Difference]: With dead ends: 138 [2024-10-13 10:55:08,492 INFO L226 Difference]: Without dead ends: 138 [2024-10-13 10:55:08,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-10-13 10:55:08,493 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 167 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:08,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 260 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:55:08,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-13 10:55:08,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 128. [2024-10-13 10:55:08,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 92 states have (on average 1.5) internal successors, (138), 126 states have internal predecessors, (138), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:08,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2024-10-13 10:55:08,497 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 14 [2024-10-13 10:55:08,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:08,497 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2024-10-13 10:55:08,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:08,497 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2024-10-13 10:55:08,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 10:55:08,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:08,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:08,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:55:08,498 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:08,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:08,499 INFO L85 PathProgramCache]: Analyzing trace with hash -788386787, now seen corresponding path program 1 times [2024-10-13 10:55:08,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:08,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38726629] [2024-10-13 10:55:08,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:08,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:08,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:08,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38726629] [2024-10-13 10:55:08,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38726629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:08,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:08,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:55:08,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152948626] [2024-10-13 10:55:08,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:08,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:55:08,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:08,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:55:08,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:55:08,702 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:08,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:08,984 INFO L93 Difference]: Finished difference Result 169 states and 192 transitions. [2024-10-13 10:55:08,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:55:08,984 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-13 10:55:08,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:08,985 INFO L225 Difference]: With dead ends: 169 [2024-10-13 10:55:08,985 INFO L226 Difference]: Without dead ends: 169 [2024-10-13 10:55:08,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:55:08,986 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 236 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:08,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 275 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:08,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-13 10:55:08,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 135. [2024-10-13 10:55:08,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 99 states have (on average 1.4747474747474747) internal successors, (146), 133 states have internal predecessors, (146), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:08,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 152 transitions. [2024-10-13 10:55:08,991 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 152 transitions. Word has length 17 [2024-10-13 10:55:08,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:08,991 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 152 transitions. [2024-10-13 10:55:08,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:08,991 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 152 transitions. [2024-10-13 10:55:08,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:55:08,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:08,992 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:08,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 10:55:08,992 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:08,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:08,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1577864059, now seen corresponding path program 1 times [2024-10-13 10:55:08,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:08,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312103550] [2024-10-13 10:55:08,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:08,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:09,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:09,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:09,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312103550] [2024-10-13 10:55:09,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312103550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:09,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:09,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:55:09,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418022205] [2024-10-13 10:55:09,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:09,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:55:09,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:09,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:55:09,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:09,117 INFO L87 Difference]: Start difference. First operand 135 states and 152 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:09,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:09,239 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2024-10-13 10:55:09,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:55:09,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-13 10:55:09,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:09,241 INFO L225 Difference]: With dead ends: 134 [2024-10-13 10:55:09,241 INFO L226 Difference]: Without dead ends: 134 [2024-10-13 10:55:09,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:55:09,242 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 2 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:09,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 276 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:09,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-13 10:55:09,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-13 10:55:09,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 132 states have internal predecessors, (145), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 151 transitions. [2024-10-13 10:55:09,257 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 151 transitions. Word has length 19 [2024-10-13 10:55:09,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:09,257 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 151 transitions. [2024-10-13 10:55:09,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:09,257 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 151 transitions. [2024-10-13 10:55:09,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:55:09,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:09,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:09,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 10:55:09,261 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:09,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:09,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1577864058, now seen corresponding path program 1 times [2024-10-13 10:55:09,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:09,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90970312] [2024-10-13 10:55:09,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:09,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:09,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:09,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:09,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90970312] [2024-10-13 10:55:09,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90970312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:09,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:09,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:55:09,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274406672] [2024-10-13 10:55:09,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:09,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:55:09,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:09,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:55:09,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:09,457 INFO L87 Difference]: Start difference. First operand 134 states and 151 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:09,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:09,602 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2024-10-13 10:55:09,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:55:09,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-13 10:55:09,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:09,604 INFO L225 Difference]: With dead ends: 133 [2024-10-13 10:55:09,604 INFO L226 Difference]: Without dead ends: 133 [2024-10-13 10:55:09,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:55:09,605 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 1 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:09,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 264 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:09,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-13 10:55:09,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-10-13 10:55:09,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 99 states have (on average 1.4545454545454546) internal successors, (144), 131 states have internal predecessors, (144), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:09,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 150 transitions. [2024-10-13 10:55:09,609 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 150 transitions. Word has length 19 [2024-10-13 10:55:09,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:09,609 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 150 transitions. [2024-10-13 10:55:09,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:09,609 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 150 transitions. [2024-10-13 10:55:09,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 10:55:09,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:09,610 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:09,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 10:55:09,611 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:09,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:09,611 INFO L85 PathProgramCache]: Analyzing trace with hash -14600253, now seen corresponding path program 1 times [2024-10-13 10:55:09,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:09,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391115470] [2024-10-13 10:55:09,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:09,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:09,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:09,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:09,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391115470] [2024-10-13 10:55:09,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391115470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:09,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:09,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:55:09,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179016793] [2024-10-13 10:55:09,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:09,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:55:09,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:09,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:55:09,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:55:09,691 INFO L87 Difference]: Start difference. First operand 133 states and 150 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:09,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:09,797 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2024-10-13 10:55:09,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:55:09,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-13 10:55:09,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:09,798 INFO L225 Difference]: With dead ends: 132 [2024-10-13 10:55:09,798 INFO L226 Difference]: Without dead ends: 132 [2024-10-13 10:55:09,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:09,799 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 14 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:09,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 200 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:09,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-13 10:55:09,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-10-13 10:55:09,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 99 states have (on average 1.4343434343434343) internal successors, (142), 130 states have internal predecessors, (142), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:09,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 147 transitions. [2024-10-13 10:55:09,805 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 147 transitions. Word has length 21 [2024-10-13 10:55:09,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:09,805 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 147 transitions. [2024-10-13 10:55:09,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:09,805 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 147 transitions. [2024-10-13 10:55:09,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 10:55:09,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:09,807 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:09,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 10:55:09,807 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:09,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:09,807 INFO L85 PathProgramCache]: Analyzing trace with hash 941654992, now seen corresponding path program 1 times [2024-10-13 10:55:09,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:09,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651202548] [2024-10-13 10:55:09,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:09,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:10,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:10,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651202548] [2024-10-13 10:55:10,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651202548] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:55:10,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767132843] [2024-10-13 10:55:10,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:10,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:55:10,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:55:10,017 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-10-13 10:55:10,019 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-10-13 10:55:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:10,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 10:55:10,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:10,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:55:10,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:55:10,275 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 19 treesize of output 18 [2024-10-13 10:55:10,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 10:55:10,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 10:55:10,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-13 10:55:10,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-10-13 10:55:10,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:10,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:55:10,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-13 10:55:10,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-10-13 10:55:10,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-13 10:55:10,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:55:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:10,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767132843] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:55:10,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:55:10,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 14 [2024-10-13 10:55:10,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545459973] [2024-10-13 10:55:10,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:55:10,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:55:10,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:10,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:55:10,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:55:10,925 INFO L87 Difference]: Start difference. First operand 132 states and 147 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:11,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:11,397 INFO L93 Difference]: Finished difference Result 165 states and 189 transitions. [2024-10-13 10:55:11,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:55:11,398 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-13 10:55:11,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:11,399 INFO L225 Difference]: With dead ends: 165 [2024-10-13 10:55:11,399 INFO L226 Difference]: Without dead ends: 165 [2024-10-13 10:55:11,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2024-10-13 10:55:11,400 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 294 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:11,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 318 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:55:11,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-13 10:55:11,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 158. [2024-10-13 10:55:11,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 125 states have (on average 1.44) internal successors, (180), 156 states have internal predecessors, (180), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:11,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 185 transitions. [2024-10-13 10:55:11,404 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 185 transitions. Word has length 21 [2024-10-13 10:55:11,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:11,404 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 185 transitions. [2024-10-13 10:55:11,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:11,404 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 185 transitions. [2024-10-13 10:55:11,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 10:55:11,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:11,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:11,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 10:55:11,607 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,SelfDestructingSolverStorable15 [2024-10-13 10:55:11,608 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:11,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:11,608 INFO L85 PathProgramCache]: Analyzing trace with hash -203654580, now seen corresponding path program 1 times [2024-10-13 10:55:11,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:11,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41799669] [2024-10-13 10:55:11,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:11,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:11,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:11,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:11,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41799669] [2024-10-13 10:55:11,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41799669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:11,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:11,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:55:11,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845822375] [2024-10-13 10:55:11,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:11,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:55:11,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:11,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:55:11,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:55:11,857 INFO L87 Difference]: Start difference. First operand 158 states and 185 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:12,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:12,083 INFO L93 Difference]: Finished difference Result 157 states and 184 transitions. [2024-10-13 10:55:12,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:55:12,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-13 10:55:12,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:12,085 INFO L225 Difference]: With dead ends: 157 [2024-10-13 10:55:12,085 INFO L226 Difference]: Without dead ends: 157 [2024-10-13 10:55:12,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:55:12,086 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 36 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:12,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 207 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:12,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-13 10:55:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-10-13 10:55:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 125 states have (on average 1.432) internal successors, (179), 155 states have internal predecessors, (179), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 184 transitions. [2024-10-13 10:55:12,090 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 184 transitions. Word has length 21 [2024-10-13 10:55:12,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:12,090 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 184 transitions. [2024-10-13 10:55:12,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:12,090 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 184 transitions. [2024-10-13 10:55:12,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 10:55:12,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:12,091 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:12,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 10:55:12,091 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:12,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:12,092 INFO L85 PathProgramCache]: Analyzing trace with hash -203654579, now seen corresponding path program 1 times [2024-10-13 10:55:12,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:12,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718375666] [2024-10-13 10:55:12,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:12,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:12,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:12,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:12,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718375666] [2024-10-13 10:55:12,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718375666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:12,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:12,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:55:12,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075336500] [2024-10-13 10:55:12,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:12,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:55:12,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:12,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:55:12,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:55:12,471 INFO L87 Difference]: Start difference. First operand 157 states and 184 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:12,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:12,733 INFO L93 Difference]: Finished difference Result 153 states and 180 transitions. [2024-10-13 10:55:12,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:55:12,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-13 10:55:12,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:12,735 INFO L225 Difference]: With dead ends: 153 [2024-10-13 10:55:12,735 INFO L226 Difference]: Without dead ends: 153 [2024-10-13 10:55:12,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:55:12,735 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 52 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:12,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 246 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:12,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-13 10:55:12,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 136. [2024-10-13 10:55:12,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 111 states have (on average 1.3963963963963963) internal successors, (155), 134 states have internal predecessors, (155), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 160 transitions. [2024-10-13 10:55:12,739 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 160 transitions. Word has length 21 [2024-10-13 10:55:12,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:12,739 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 160 transitions. [2024-10-13 10:55:12,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:12,740 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 160 transitions. [2024-10-13 10:55:12,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 10:55:12,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:12,740 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:12,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 10:55:12,741 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:12,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:12,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1720838367, now seen corresponding path program 1 times [2024-10-13 10:55:12,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:12,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781113447] [2024-10-13 10:55:12,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:12,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:12,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:12,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781113447] [2024-10-13 10:55:12,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781113447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:12,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:12,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:55:12,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455542813] [2024-10-13 10:55:12,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:12,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:55:12,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:12,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:55:12,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:12,802 INFO L87 Difference]: Start difference. First operand 136 states and 160 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:12,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:12,932 INFO L93 Difference]: Finished difference Result 133 states and 155 transitions. [2024-10-13 10:55:12,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:55:12,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-13 10:55:12,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:12,933 INFO L225 Difference]: With dead ends: 133 [2024-10-13 10:55:12,933 INFO L226 Difference]: Without dead ends: 133 [2024-10-13 10:55:12,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:55:12,934 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 16 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:12,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 222 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:12,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-13 10:55:12,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-10-13 10:55:12,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 108 states have (on average 1.3888888888888888) internal successors, (150), 131 states have internal predecessors, (150), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:12,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2024-10-13 10:55:12,938 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 23 [2024-10-13 10:55:12,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:12,938 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2024-10-13 10:55:12,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:12,938 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2024-10-13 10:55:12,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:55:12,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:12,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:12,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 10:55:12,939 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:12,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:12,940 INFO L85 PathProgramCache]: Analyzing trace with hash 919714024, now seen corresponding path program 1 times [2024-10-13 10:55:12,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:12,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690144516] [2024-10-13 10:55:12,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:12,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:13,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:13,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690144516] [2024-10-13 10:55:13,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690144516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:13,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:13,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:55:13,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043036667] [2024-10-13 10:55:13,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:13,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:55:13,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:13,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:55:13,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:55:13,093 INFO L87 Difference]: Start difference. First operand 133 states and 155 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:13,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:13,196 INFO L93 Difference]: Finished difference Result 133 states and 154 transitions. [2024-10-13 10:55:13,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:55:13,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-13 10:55:13,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:13,197 INFO L225 Difference]: With dead ends: 133 [2024-10-13 10:55:13,197 INFO L226 Difference]: Without dead ends: 133 [2024-10-13 10:55:13,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:13,198 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 10 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:13,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 182 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:13,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-13 10:55:13,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2024-10-13 10:55:13,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 130 states have internal predecessors, (149), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:13,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 153 transitions. [2024-10-13 10:55:13,203 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 153 transitions. Word has length 24 [2024-10-13 10:55:13,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:13,203 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 153 transitions. [2024-10-13 10:55:13,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:13,204 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2024-10-13 10:55:13,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:55:13,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:13,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:13,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 10:55:13,205 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:13,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:13,205 INFO L85 PathProgramCache]: Analyzing trace with hash -971944067, now seen corresponding path program 1 times [2024-10-13 10:55:13,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:13,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553931819] [2024-10-13 10:55:13,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:13,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:13,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:13,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553931819] [2024-10-13 10:55:13,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553931819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:13,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:13,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 10:55:13,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815985434] [2024-10-13 10:55:13,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:13,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:55:13,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:13,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:55:13,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:55:13,457 INFO L87 Difference]: Start difference. First operand 132 states and 153 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:13,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:13,839 INFO L93 Difference]: Finished difference Result 155 states and 177 transitions. [2024-10-13 10:55:13,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:55:13,840 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-13 10:55:13,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:13,841 INFO L225 Difference]: With dead ends: 155 [2024-10-13 10:55:13,841 INFO L226 Difference]: Without dead ends: 155 [2024-10-13 10:55:13,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2024-10-13 10:55:13,841 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 201 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:13,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 240 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:13,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-13 10:55:13,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 139. [2024-10-13 10:55:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 115 states have (on average 1.3565217391304347) internal successors, (156), 137 states have internal predecessors, (156), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 160 transitions. [2024-10-13 10:55:13,847 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 160 transitions. Word has length 26 [2024-10-13 10:55:13,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:13,847 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 160 transitions. [2024-10-13 10:55:13,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 160 transitions. [2024-10-13 10:55:13,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:55:13,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:13,848 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:13,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 10:55:13,848 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:13,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:13,848 INFO L85 PathProgramCache]: Analyzing trace with hash -598426252, now seen corresponding path program 1 times [2024-10-13 10:55:13,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:13,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604351037] [2024-10-13 10:55:13,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:13,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:55:13,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:13,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604351037] [2024-10-13 10:55:13,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604351037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:13,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:13,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:55:13,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248313628] [2024-10-13 10:55:13,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:13,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:55:13,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:13,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:55:13,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:13,889 INFO L87 Difference]: Start difference. First operand 139 states and 160 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:13,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:13,949 INFO L93 Difference]: Finished difference Result 143 states and 162 transitions. [2024-10-13 10:55:13,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:55:13,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-13 10:55:13,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:13,950 INFO L225 Difference]: With dead ends: 143 [2024-10-13 10:55:13,950 INFO L226 Difference]: Without dead ends: 143 [2024-10-13 10:55:13,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:13,951 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 46 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:13,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 89 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:13,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-13 10:55:13,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-10-13 10:55:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 141 states have internal predecessors, (158), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:13,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 162 transitions. [2024-10-13 10:55:13,955 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 162 transitions. Word has length 26 [2024-10-13 10:55:13,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:13,955 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 162 transitions. [2024-10-13 10:55:13,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:13,956 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 162 transitions. [2024-10-13 10:55:13,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 10:55:13,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:13,957 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:13,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 10:55:13,957 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:13,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:13,958 INFO L85 PathProgramCache]: Analyzing trace with hash 437999511, now seen corresponding path program 1 times [2024-10-13 10:55:13,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:13,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646413869] [2024-10-13 10:55:13,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:13,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:14,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:14,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:14,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646413869] [2024-10-13 10:55:14,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646413869] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:55:14,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931422385] [2024-10-13 10:55:14,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:14,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:55:14,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:55:14,090 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-10-13 10:55:14,091 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-10-13 10:55:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:14,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 10:55:14,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:14,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 10:55:14,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-10-13 10:55:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:55:14,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:14,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931422385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:14,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:55:14,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-10-13 10:55:14,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540228765] [2024-10-13 10:55:14,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:14,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:55:14,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:14,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:55:14,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:55:14,294 INFO L87 Difference]: Start difference. First operand 143 states and 162 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:14,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:14,384 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2024-10-13 10:55:14,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:55:14,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-13 10:55:14,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:14,386 INFO L225 Difference]: With dead ends: 138 [2024-10-13 10:55:14,386 INFO L226 Difference]: Without dead ends: 138 [2024-10-13 10:55:14,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:55:14,388 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 4 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:14,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 202 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:14,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-13 10:55:14,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2024-10-13 10:55:14,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 113 states have (on average 1.3185840707964602) internal successors, (149), 135 states have internal predecessors, (149), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:14,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 153 transitions. [2024-10-13 10:55:14,392 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 153 transitions. Word has length 28 [2024-10-13 10:55:14,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:14,393 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 153 transitions. [2024-10-13 10:55:14,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:14,393 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 153 transitions. [2024-10-13 10:55:14,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 10:55:14,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:14,394 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:14,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 10:55:14,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-13 10:55:14,599 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:14,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:14,599 INFO L85 PathProgramCache]: Analyzing trace with hash -978016469, now seen corresponding path program 1 times [2024-10-13 10:55:14,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:14,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876250325] [2024-10-13 10:55:14,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:14,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:14,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:14,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876250325] [2024-10-13 10:55:14,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876250325] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:55:14,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958589138] [2024-10-13 10:55:14,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:14,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:55:14,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:55:14,760 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:55:14,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 10:55:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:14,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 10:55:14,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:14,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:55:14,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:55:14,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-13 10:55:14,924 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-10-13 10:55:14,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:55:14,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 36 treesize of output 23 [2024-10-13 10:55:14,959 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-10-13 10:55:15,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-13 10:55:15,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:55:15,083 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 24 treesize of output 10 [2024-10-13 10:55:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:55:15,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:55:15,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:55:15,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958589138] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:55:15,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:55:15,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 8 [2024-10-13 10:55:15,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709654952] [2024-10-13 10:55:15,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:55:15,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:55:15,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:15,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:55:15,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:55:15,206 INFO L87 Difference]: Start difference. First operand 137 states and 153 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:15,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:15,529 INFO L93 Difference]: Finished difference Result 151 states and 171 transitions. [2024-10-13 10:55:15,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:55:15,530 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-13 10:55:15,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:15,531 INFO L225 Difference]: With dead ends: 151 [2024-10-13 10:55:15,531 INFO L226 Difference]: Without dead ends: 151 [2024-10-13 10:55:15,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:55:15,533 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 19 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:15,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 233 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:55:15,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-13 10:55:15,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 135. [2024-10-13 10:55:15,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 111 states have (on average 1.2882882882882882) internal successors, (143), 133 states have internal predecessors, (143), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2024-10-13 10:55:15,536 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 29 [2024-10-13 10:55:15,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:15,537 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2024-10-13 10:55:15,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:15,537 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2024-10-13 10:55:15,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 10:55:15,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:15,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:15,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 10:55:15,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:55:15,742 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:15,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:15,742 INFO L85 PathProgramCache]: Analyzing trace with hash -253739806, now seen corresponding path program 1 times [2024-10-13 10:55:15,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:15,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159088269] [2024-10-13 10:55:15,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:15,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 10:55:15,762 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 10:55:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 10:55:15,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 10:55:15,796 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 10:55:15,797 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK (70 of 71 remaining) [2024-10-13 10:55:15,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (69 of 71 remaining) [2024-10-13 10:55:15,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 71 remaining) [2024-10-13 10:55:15,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 71 remaining) [2024-10-13 10:55:15,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 71 remaining) [2024-10-13 10:55:15,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 71 remaining) [2024-10-13 10:55:15,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 71 remaining) [2024-10-13 10:55:15,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 71 remaining) [2024-10-13 10:55:15,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 71 remaining) [2024-10-13 10:55:15,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 71 remaining) [2024-10-13 10:55:15,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 71 remaining) [2024-10-13 10:55:15,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 71 remaining) [2024-10-13 10:55:15,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 71 remaining) [2024-10-13 10:55:15,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 71 remaining) [2024-10-13 10:55:15,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 71 remaining) [2024-10-13 10:55:15,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 71 remaining) [2024-10-13 10:55:15,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 71 remaining) [2024-10-13 10:55:15,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 71 remaining) [2024-10-13 10:55:15,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 71 remaining) [2024-10-13 10:55:15,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 71 remaining) [2024-10-13 10:55:15,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 71 remaining) [2024-10-13 10:55:15,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 71 remaining) [2024-10-13 10:55:15,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 71 remaining) [2024-10-13 10:55:15,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 71 remaining) [2024-10-13 10:55:15,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 71 remaining) [2024-10-13 10:55:15,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 71 remaining) [2024-10-13 10:55:15,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 71 remaining) [2024-10-13 10:55:15,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 71 remaining) [2024-10-13 10:55:15,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 71 remaining) [2024-10-13 10:55:15,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 71 remaining) [2024-10-13 10:55:15,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 71 remaining) [2024-10-13 10:55:15,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 71 remaining) [2024-10-13 10:55:15,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 71 remaining) [2024-10-13 10:55:15,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 71 remaining) [2024-10-13 10:55:15,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 71 remaining) [2024-10-13 10:55:15,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 71 remaining) [2024-10-13 10:55:15,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 71 remaining) [2024-10-13 10:55:15,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 71 remaining) [2024-10-13 10:55:15,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 71 remaining) [2024-10-13 10:55:15,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 71 remaining) [2024-10-13 10:55:15,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 71 remaining) [2024-10-13 10:55:15,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 71 remaining) [2024-10-13 10:55:15,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 71 remaining) [2024-10-13 10:55:15,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 71 remaining) [2024-10-13 10:55:15,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 71 remaining) [2024-10-13 10:55:15,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 71 remaining) [2024-10-13 10:55:15,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 71 remaining) [2024-10-13 10:55:15,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 71 remaining) [2024-10-13 10:55:15,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 71 remaining) [2024-10-13 10:55:15,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 71 remaining) [2024-10-13 10:55:15,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 71 remaining) [2024-10-13 10:55:15,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 71 remaining) [2024-10-13 10:55:15,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 71 remaining) [2024-10-13 10:55:15,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 71 remaining) [2024-10-13 10:55:15,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 71 remaining) [2024-10-13 10:55:15,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 71 remaining) [2024-10-13 10:55:15,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 71 remaining) [2024-10-13 10:55:15,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 71 remaining) [2024-10-13 10:55:15,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE (12 of 71 remaining) [2024-10-13 10:55:15,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE (11 of 71 remaining) [2024-10-13 10:55:15,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE (10 of 71 remaining) [2024-10-13 10:55:15,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 71 remaining) [2024-10-13 10:55:15,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 71 remaining) [2024-10-13 10:55:15,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE (7 of 71 remaining) [2024-10-13 10:55:15,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE (6 of 71 remaining) [2024-10-13 10:55:15,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (5 of 71 remaining) [2024-10-13 10:55:15,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 71 remaining) [2024-10-13 10:55:15,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 71 remaining) [2024-10-13 10:55:15,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE (2 of 71 remaining) [2024-10-13 10:55:15,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE (1 of 71 remaining) [2024-10-13 10:55:15,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE (0 of 71 remaining) [2024-10-13 10:55:15,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 10:55:15,814 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:15,845 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 10:55:15,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:55:15 BoogieIcfgContainer [2024-10-13 10:55:15,850 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 10:55:15,851 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 10:55:15,851 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 10:55:15,853 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 10:55:15,853 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:55:03" (3/4) ... [2024-10-13 10:55:15,855 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 10:55:15,857 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 10:55:15,858 INFO L158 Benchmark]: Toolchain (without parser) took 13677.07ms. Allocated memory was 136.3MB in the beginning and 262.1MB in the end (delta: 125.8MB). Free memory was 64.0MB in the beginning and 180.2MB in the end (delta: -116.1MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-10-13 10:55:15,858 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 136.3MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:55:15,858 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.22ms. Allocated memory was 136.3MB in the beginning and 180.4MB in the end (delta: 44.0MB). Free memory was 63.9MB in the beginning and 142.1MB in the end (delta: -78.2MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2024-10-13 10:55:15,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.22ms. Allocated memory is still 180.4MB. Free memory was 142.1MB in the beginning and 140.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:55:15,859 INFO L158 Benchmark]: Boogie Preprocessor took 68.95ms. Allocated memory is still 180.4MB. Free memory was 140.0MB in the beginning and 136.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 10:55:15,859 INFO L158 Benchmark]: RCFGBuilder took 854.33ms. Allocated memory is still 180.4MB. Free memory was 136.7MB in the beginning and 101.2MB in the end (delta: 35.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-13 10:55:15,859 INFO L158 Benchmark]: TraceAbstraction took 12201.92ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 100.2MB in the beginning and 181.2MB in the end (delta: -81.0MB). Peak memory consumption was 1.8MB. Max. memory is 16.1GB. [2024-10-13 10:55:15,860 INFO L158 Benchmark]: Witness Printer took 6.40ms. Allocated memory is still 262.1MB. Free memory was 181.2MB in the beginning and 180.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:55:15,862 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 136.3MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 492.22ms. Allocated memory was 136.3MB in the beginning and 180.4MB in the end (delta: 44.0MB). Free memory was 63.9MB in the beginning and 142.1MB in the end (delta: -78.2MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.22ms. Allocated memory is still 180.4MB. Free memory was 142.1MB in the beginning and 140.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.95ms. Allocated memory is still 180.4MB. Free memory was 140.0MB in the beginning and 136.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 854.33ms. Allocated memory is still 180.4MB. Free memory was 136.7MB in the beginning and 101.2MB in the end (delta: 35.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12201.92ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 100.2MB in the beginning and 181.2MB in the end (delta: -81.0MB). Peak memory consumption was 1.8MB. Max. memory is 16.1GB. * Witness Printer took 6.40ms. Allocated memory is still 262.1MB. Free memory was 181.2MB in the beginning and 180.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 996]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 996. Possible FailurePath: [L998] struct TSLL* null = malloc(sizeof(struct TSLL)); [L999] null->next = ((void*)0) [L1000] null->prev = ((void*)0) [L1001] null->colour = BLACK [L1003] struct TSLL* list = malloc(sizeof(struct TSLL)); [L1004] list->next = null [L1005] list->prev = null [L1006] list->colour = BLACK [L1008] struct TSLL* end = list; VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1037] end = null [L1038] end = list VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1041] COND FALSE !(!(null != end)) VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1042] EXPR end->colour [L1042] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE null != end VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1045] EXPR end->colour [L1045] COND FALSE !(RED == end->colour) [L1052] EXPR end->next [L1052] end = end->next [L1043] COND FALSE !(null != end) VAL [list={-2:0}, null={-1:0}] [L1056] COND TRUE null != list VAL [list={-2:0}, null={-1:0}] [L1058] EXPR list->colour [L1058] COND FALSE !(RED == list->colour) [L1067] EXPR list->next [L1067] end = list->next [L1068] free(list) VAL [end={-1:0}, null={-1:0}] [L1068] free(list) VAL [end={-1:0}, null={-1:0}] [L1068] free(list) [L1069] list = end VAL [list={-1:0}, null={-1:0}] [L1056] COND FALSE !(null != list) [L1073] return 0; VAL [\result=0] - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 154 locations, 71 error locations. Started 1 CEGAR loops. OverallTime: 12.1s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2169 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2169 mSDsluCounter, 4682 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2937 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5143 IncrementalHoareTripleChecker+Invalid, 5353 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 1745 mSDtfsCounter, 5143 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=16, InterpolantAutomatonStates: 146, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 160 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 503 NumberOfCodeBlocks, 503 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 494 ConstructedInterpolants, 5 QuantifiedInterpolants, 3781 SizeOfPredicates, 15 NumberOfNonLiveVariables, 595 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 29 InterpolantComputations, 22 PerfectInterpolantSequences, 10/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 10:55:15,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:55:18,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:55:18,216 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 10:55:18,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:55:18,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:55:18,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:55:18,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:55:18,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:55:18,257 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:55:18,258 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:55:18,259 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:55:18,259 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:55:18,260 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:55:18,261 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:55:18,262 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:55:18,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:55:18,262 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:55:18,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:55:18,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:55:18,266 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:55:18,266 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:55:18,267 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:55:18,267 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:55:18,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:55:18,267 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:55:18,268 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 10:55:18,268 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:55:18,268 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 10:55:18,268 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:55:18,268 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:55:18,269 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:55:18,269 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:55:18,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:55:18,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:55:18,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:55:18,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:55:18,272 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:55:18,272 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:55:18,272 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 10:55:18,272 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 10:55:18,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:55:18,273 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:55:18,273 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:55:18,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:55:18,274 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 10:55:18,274 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 -> 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 [2024-10-13 10:55:18,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:55:18,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:55:18,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:55:18,643 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:55:18,644 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:55:18,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2024-10-13 10:55:20,246 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:55:20,488 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:55:20,492 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2024-10-13 10:55:20,507 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cb8920ad/a7fc3bad9914476a976303d93a81e61d/FLAG69438afed [2024-10-13 10:55:20,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cb8920ad/a7fc3bad9914476a976303d93a81e61d [2024-10-13 10:55:20,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:55:20,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:55:20,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:55:20,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:55:20,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:55:20,532 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:55:20" (1/1) ... [2024-10-13 10:55:20,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ccdb7ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:20, skipping insertion in model container [2024-10-13 10:55:20,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:55:20" (1/1) ... [2024-10-13 10:55:20,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:55:20,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:55:20,949 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:55:21,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:55:21,049 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:55:21,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:21 WrapperNode [2024-10-13 10:55:21,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:55:21,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:55:21,051 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:55:21,051 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:55:21,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:21" (1/1) ... [2024-10-13 10:55:21,082 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:21" (1/1) ... [2024-10-13 10:55:21,105 INFO L138 Inliner]: procedures = 122, calls = 50, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 165 [2024-10-13 10:55:21,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:55:21,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:55:21,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:55:21,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:55:21,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:21" (1/1) ... [2024-10-13 10:55:21,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:21" (1/1) ... [2024-10-13 10:55:21,125 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:21" (1/1) ... [2024-10-13 10:55:21,142 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2024-10-13 10:55:21,143 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:21" (1/1) ... [2024-10-13 10:55:21,143 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:21" (1/1) ... [2024-10-13 10:55:21,153 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:21" (1/1) ... [2024-10-13 10:55:21,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:21" (1/1) ... [2024-10-13 10:55:21,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:21" (1/1) ... [2024-10-13 10:55:21,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:21" (1/1) ... [2024-10-13 10:55:21,172 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:55:21,176 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:55:21,176 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:55:21,176 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:55:21,177 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:21" (1/1) ... [2024-10-13 10:55:21,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:55:21,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:55:21,207 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-10-13 10:55:21,209 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-10-13 10:55:21,251 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-13 10:55:21,251 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-13 10:55:21,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 10:55:21,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 10:55:21,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:55:21,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:55:21,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:55:21,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:55:21,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:55:21,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:55:21,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:55:21,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 10:55:21,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 10:55:21,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 10:55:21,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 10:55:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:55:21,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:55:21,369 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:55:21,371 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:55:22,050 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2024-10-13 10:55:22,050 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:55:22,101 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:55:22,102 INFO L314 CfgBuilder]: Removed 17 assume(true) statements. [2024-10-13 10:55:22,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:55:22 BoogieIcfgContainer [2024-10-13 10:55:22,104 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:55:22,106 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:55:22,106 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:55:22,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:55:22,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:55:20" (1/3) ... [2024-10-13 10:55:22,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@529269f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:55:22, skipping insertion in model container [2024-10-13 10:55:22,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:21" (2/3) ... [2024-10-13 10:55:22,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@529269f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:55:22, skipping insertion in model container [2024-10-13 10:55:22,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:55:22" (3/3) ... [2024-10-13 10:55:22,115 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2024-10-13 10:55:22,132 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:55:22,132 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 71 error locations. [2024-10-13 10:55:22,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:55:22,196 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;@68ebb22d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:55:22,196 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2024-10-13 10:55:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand has 154 states, 74 states have (on average 2.3783783783783785) internal successors, (176), 145 states have internal predecessors, (176), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 10:55:22,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 10:55:22,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:22,209 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 10:55:22,213 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:22,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:22,219 INFO L85 PathProgramCache]: Analyzing trace with hash 11638, now seen corresponding path program 1 times [2024-10-13 10:55:22,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:22,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736732989] [2024-10-13 10:55:22,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:22,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:22,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:22,236 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:22,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 10:55:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:22,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:55:22,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:22,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 10:55:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:22,386 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:22,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:55:22,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736732989] [2024-10-13 10:55:22,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736732989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:22,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:22,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:55:22,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020436740] [2024-10-13 10:55:22,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:22,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:55:22,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:55:22,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:55:22,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:22,430 INFO L87 Difference]: Start difference. First operand has 154 states, 74 states have (on average 2.3783783783783785) internal successors, (176), 145 states have internal predecessors, (176), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:22,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:22,773 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2024-10-13 10:55:22,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:55:22,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 10:55:22,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:22,784 INFO L225 Difference]: With dead ends: 165 [2024-10-13 10:55:22,784 INFO L226 Difference]: Without dead ends: 164 [2024-10-13 10:55:22,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:22,789 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 122 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:22,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 96 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:55:22,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-13 10:55:22,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 141. [2024-10-13 10:55:22,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 66 states have (on average 2.196969696969697) internal successors, (145), 139 states have internal predecessors, (145), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:22,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2024-10-13 10:55:22,830 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 2 [2024-10-13 10:55:22,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:22,831 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2024-10-13 10:55:22,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:22,831 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2024-10-13 10:55:22,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 10:55:22,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:22,832 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 10:55:22,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 10:55:23,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:23,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:23,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:23,034 INFO L85 PathProgramCache]: Analyzing trace with hash 11639, now seen corresponding path program 1 times [2024-10-13 10:55:23,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:23,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282566511] [2024-10-13 10:55:23,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:23,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:23,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:23,039 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:23,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 10:55:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:23,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:55:23,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:23,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:55:23,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:23,145 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:23,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:55:23,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282566511] [2024-10-13 10:55:23,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282566511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:23,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:23,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:55:23,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400254642] [2024-10-13 10:55:23,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:23,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:55:23,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:55:23,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:55:23,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:23,152 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:23,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:23,596 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2024-10-13 10:55:23,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:55:23,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 10:55:23,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:23,599 INFO L225 Difference]: With dead ends: 138 [2024-10-13 10:55:23,599 INFO L226 Difference]: Without dead ends: 138 [2024-10-13 10:55:23,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:23,601 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 133 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:23,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 82 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:55:23,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-13 10:55:23,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-10-13 10:55:23,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 66 states have (on average 2.1515151515151514) internal successors, (142), 136 states have internal predecessors, (142), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:23,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2024-10-13 10:55:23,622 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 2 [2024-10-13 10:55:23,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:23,622 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2024-10-13 10:55:23,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:23,622 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2024-10-13 10:55:23,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:55:23,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:23,623 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:55:23,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 10:55:23,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:23,827 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:23,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:23,827 INFO L85 PathProgramCache]: Analyzing trace with hash 346702845, now seen corresponding path program 1 times [2024-10-13 10:55:23,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:23,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372062615] [2024-10-13 10:55:23,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:23,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:23,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:23,832 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:23,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 10:55:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:23,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:55:23,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:23,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 10:55:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:23,919 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:23,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:55:23,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372062615] [2024-10-13 10:55:23,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [372062615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:23,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:23,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:55:23,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058322342] [2024-10-13 10:55:23,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:23,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:55:23,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:55:23,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:55:23,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:23,923 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:24,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:24,155 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2024-10-13 10:55:24,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:55:24,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-10-13 10:55:24,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:24,157 INFO L225 Difference]: With dead ends: 133 [2024-10-13 10:55:24,157 INFO L226 Difference]: Without dead ends: 133 [2024-10-13 10:55:24,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:24,158 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 104 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:24,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 85 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:24,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-13 10:55:24,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-10-13 10:55:24,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 68 states have (on average 2.0441176470588234) internal successors, (139), 131 states have internal predecessors, (139), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:24,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2024-10-13 10:55:24,166 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 5 [2024-10-13 10:55:24,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:24,166 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2024-10-13 10:55:24,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:24,166 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2024-10-13 10:55:24,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:55:24,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:24,167 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:55:24,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 10:55:24,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:24,368 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:24,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:24,369 INFO L85 PathProgramCache]: Analyzing trace with hash 346702846, now seen corresponding path program 1 times [2024-10-13 10:55:24,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:24,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652049164] [2024-10-13 10:55:24,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:24,370 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:24,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:24,373 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:24,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 10:55:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:24,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:55:24,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:24,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:55:24,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:24,466 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:24,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:55:24,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652049164] [2024-10-13 10:55:24,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652049164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:24,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:24,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:55:24,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500077321] [2024-10-13 10:55:24,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:24,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:55:24,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:55:24,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:55:24,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:24,469 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:24,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:24,758 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2024-10-13 10:55:24,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:55:24,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-10-13 10:55:24,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:24,759 INFO L225 Difference]: With dead ends: 135 [2024-10-13 10:55:24,759 INFO L226 Difference]: Without dead ends: 135 [2024-10-13 10:55:24,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:24,761 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 98 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:24,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 97 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:55:24,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-13 10:55:24,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-10-13 10:55:24,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 133 states have internal predecessors, (141), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:24,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 148 transitions. [2024-10-13 10:55:24,773 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 148 transitions. Word has length 5 [2024-10-13 10:55:24,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:24,774 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 148 transitions. [2024-10-13 10:55:24,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:24,774 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 148 transitions. [2024-10-13 10:55:24,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:55:24,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:24,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:24,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 10:55:24,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:24,978 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:24,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:24,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1246338220, now seen corresponding path program 1 times [2024-10-13 10:55:24,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:24,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691735626] [2024-10-13 10:55:24,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:24,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:24,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:24,983 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:24,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 10:55:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:25,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:55:25,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:25,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 10:55:25,159 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-13 10:55:25,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-10-13 10:55:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:25,176 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:25,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:55:25,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691735626] [2024-10-13 10:55:25,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691735626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:25,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:25,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:55:25,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210231090] [2024-10-13 10:55:25,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:25,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:55:25,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:55:25,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:55:25,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:55:25,178 INFO L87 Difference]: Start difference. First operand 135 states and 148 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:25,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:25,566 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2024-10-13 10:55:25,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:55:25,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 10:55:25,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:25,573 INFO L225 Difference]: With dead ends: 122 [2024-10-13 10:55:25,573 INFO L226 Difference]: Without dead ends: 122 [2024-10-13 10:55:25,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:25,574 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 135 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:25,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 70 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:55:25,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-13 10:55:25,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-13 10:55:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 75 states have (on average 1.7333333333333334) internal successors, (130), 120 states have internal predecessors, (130), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 137 transitions. [2024-10-13 10:55:25,585 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 137 transitions. Word has length 10 [2024-10-13 10:55:25,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:25,585 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 137 transitions. [2024-10-13 10:55:25,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:25,586 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 137 transitions. [2024-10-13 10:55:25,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:55:25,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:25,586 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:25,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 10:55:25,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:25,787 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:25,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:25,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1246338221, now seen corresponding path program 1 times [2024-10-13 10:55:25,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:25,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758039242] [2024-10-13 10:55:25,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:25,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:25,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:25,791 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:25,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 10:55:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:25,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 10:55:25,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:25,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:55:25,977 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 10:55:25,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-13 10:55:25,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:25,990 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:25,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:55:25,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758039242] [2024-10-13 10:55:25,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758039242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:25,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:25,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:55:25,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321270884] [2024-10-13 10:55:25,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:25,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:55:25,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:55:25,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:55:25,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:55:25,992 INFO L87 Difference]: Start difference. First operand 122 states and 137 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:26,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:26,372 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2024-10-13 10:55:26,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:55:26,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 10:55:26,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:26,373 INFO L225 Difference]: With dead ends: 133 [2024-10-13 10:55:26,373 INFO L226 Difference]: Without dead ends: 133 [2024-10-13 10:55:26,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:26,374 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 114 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:26,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 110 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:55:26,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-13 10:55:26,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2024-10-13 10:55:26,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 84 states have (on average 1.6785714285714286) internal successors, (141), 128 states have internal predecessors, (141), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2024-10-13 10:55:26,380 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 10 [2024-10-13 10:55:26,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:26,380 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2024-10-13 10:55:26,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:26,381 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2024-10-13 10:55:26,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:55:26,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:26,381 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:26,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-13 10:55:26,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:26,586 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:26,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:26,586 INFO L85 PathProgramCache]: Analyzing trace with hash -564564076, now seen corresponding path program 1 times [2024-10-13 10:55:26,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:26,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038359888] [2024-10-13 10:55:26,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:26,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:26,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:26,588 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:26,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 10:55:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:26,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:55:26,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:26,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 10:55:26,698 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 15 treesize of output 1 [2024-10-13 10:55:26,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-13 10:55:26,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:26,719 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:26,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:55:26,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038359888] [2024-10-13 10:55:26,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038359888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:26,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:26,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:55:26,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066030417] [2024-10-13 10:55:26,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:26,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:55:26,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:55:26,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:55:26,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:26,721 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:27,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:27,122 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2024-10-13 10:55:27,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:55:27,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2024-10-13 10:55:27,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:27,124 INFO L225 Difference]: With dead ends: 129 [2024-10-13 10:55:27,124 INFO L226 Difference]: Without dead ends: 129 [2024-10-13 10:55:27,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:55:27,125 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 3 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:27,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 300 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:55:27,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-13 10:55:27,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-10-13 10:55:27,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 84 states have (on average 1.6547619047619047) internal successors, (139), 127 states have internal predecessors, (139), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:27,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 146 transitions. [2024-10-13 10:55:27,137 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 146 transitions. Word has length 12 [2024-10-13 10:55:27,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:27,137 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 146 transitions. [2024-10-13 10:55:27,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:27,137 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 146 transitions. [2024-10-13 10:55:27,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:55:27,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:27,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:27,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 10:55:27,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:27,342 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:27,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:27,343 INFO L85 PathProgramCache]: Analyzing trace with hash -564564075, now seen corresponding path program 1 times [2024-10-13 10:55:27,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:27,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005642467] [2024-10-13 10:55:27,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:27,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:27,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:27,345 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:27,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 10:55:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:27,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 10:55:27,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:27,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:55:27,464 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 15 treesize of output 1 [2024-10-13 10:55:27,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:55:27,501 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 17 treesize of output 9 [2024-10-13 10:55:27,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:27,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:27,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:55:27,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005642467] [2024-10-13 10:55:27,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005642467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:27,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:27,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:55:27,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132132039] [2024-10-13 10:55:27,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:27,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:55:27,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:55:27,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:55:27,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:27,519 INFO L87 Difference]: Start difference. First operand 129 states and 146 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:27,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:27,956 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2024-10-13 10:55:27,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:55:27,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2024-10-13 10:55:27,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:27,957 INFO L225 Difference]: With dead ends: 128 [2024-10-13 10:55:27,957 INFO L226 Difference]: Without dead ends: 128 [2024-10-13 10:55:27,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:55:27,958 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 2 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:27,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 283 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:55:27,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-13 10:55:27,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-10-13 10:55:27,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 84 states have (on average 1.630952380952381) internal successors, (137), 126 states have internal predecessors, (137), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2024-10-13 10:55:27,962 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 12 [2024-10-13 10:55:27,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:27,963 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2024-10-13 10:55:27,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:27,963 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2024-10-13 10:55:27,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:55:27,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:27,964 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:27,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-13 10:55:28,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:28,165 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:28,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:28,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1600003297, now seen corresponding path program 1 times [2024-10-13 10:55:28,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:28,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910389126] [2024-10-13 10:55:28,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:28,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:28,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:28,167 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:28,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 10:55:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:28,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 10:55:28,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:28,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 10:55:28,284 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:55:28,285 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 13 [2024-10-13 10:55:28,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:28,317 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:28,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:55:28,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910389126] [2024-10-13 10:55:28,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910389126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:28,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:28,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:55:28,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795806497] [2024-10-13 10:55:28,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:28,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:55:28,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:55:28,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:55:28,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:28,321 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:28,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:28,721 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2024-10-13 10:55:28,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:55:28,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-13 10:55:28,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:28,724 INFO L225 Difference]: With dead ends: 159 [2024-10-13 10:55:28,724 INFO L226 Difference]: Without dead ends: 159 [2024-10-13 10:55:28,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:55:28,724 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 233 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:28,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 140 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:55:28,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-13 10:55:28,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 127. [2024-10-13 10:55:28,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 84 states have (on average 1.5952380952380953) internal successors, (134), 125 states have internal predecessors, (134), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 140 transitions. [2024-10-13 10:55:28,731 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 140 transitions. Word has length 14 [2024-10-13 10:55:28,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:28,731 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 140 transitions. [2024-10-13 10:55:28,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:28,732 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2024-10-13 10:55:28,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:55:28,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:28,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:28,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 10:55:28,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:28,933 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:28,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:28,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1379912389, now seen corresponding path program 1 times [2024-10-13 10:55:28,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:28,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681870886] [2024-10-13 10:55:28,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:28,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:28,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:28,938 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:28,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 10:55:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:29,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 10:55:29,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:29,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 10:55:29,119 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-13 10:55:29,120 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 19 treesize of output 27 [2024-10-13 10:55:29,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:55:29,254 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:55:29,254 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 36 treesize of output 35 [2024-10-13 10:55:29,273 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 27 treesize of output 15 [2024-10-13 10:55:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:29,305 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:29,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:55:29,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681870886] [2024-10-13 10:55:29,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1681870886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:29,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:29,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:55:29,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008153804] [2024-10-13 10:55:29,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:29,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:55:29,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:55:29,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:55:29,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:55:29,307 INFO L87 Difference]: Start difference. First operand 127 states and 140 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:29,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:29,993 INFO L93 Difference]: Finished difference Result 151 states and 172 transitions. [2024-10-13 10:55:29,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:55:29,994 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 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 14 [2024-10-13 10:55:29,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:29,995 INFO L225 Difference]: With dead ends: 151 [2024-10-13 10:55:29,995 INFO L226 Difference]: Without dead ends: 151 [2024-10-13 10:55:29,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:55:29,996 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 179 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:29,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 201 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 10:55:29,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-13 10:55:29,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 126. [2024-10-13 10:55:29,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 84 states have (on average 1.5833333333333333) internal successors, (133), 124 states have internal predecessors, (133), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:29,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 139 transitions. [2024-10-13 10:55:29,999 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 139 transitions. Word has length 14 [2024-10-13 10:55:29,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:29,999 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 139 transitions. [2024-10-13 10:55:29,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:29,999 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 139 transitions. [2024-10-13 10:55:30,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:55:30,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:30,000 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:30,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-13 10:55:30,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:30,201 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:30,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:30,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1379912388, now seen corresponding path program 1 times [2024-10-13 10:55:30,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:30,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067938057] [2024-10-13 10:55:30,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:30,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:30,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:30,204 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:30,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 10:55:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:30,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 10:55:30,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:30,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 10:55:30,386 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:55:30,386 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 13 [2024-10-13 10:55:30,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:55:30,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:55:30,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:55:30,514 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:55:30,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-13 10:55:30,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-13 10:55:30,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-13 10:55:30,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-13 10:55:30,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:30,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:30,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:55:30,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067938057] [2024-10-13 10:55:30,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2067938057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:30,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:30,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:55:30,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385377053] [2024-10-13 10:55:30,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:30,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:55:30,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:55:30,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:55:30,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:55:30,573 INFO L87 Difference]: Start difference. First operand 126 states and 139 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:31,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:31,536 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2024-10-13 10:55:31,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:55:31,537 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 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 14 [2024-10-13 10:55:31,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:31,537 INFO L225 Difference]: With dead ends: 138 [2024-10-13 10:55:31,537 INFO L226 Difference]: Without dead ends: 138 [2024-10-13 10:55:31,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-10-13 10:55:31,538 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 166 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:31,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 222 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 10:55:31,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-13 10:55:31,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 128. [2024-10-13 10:55:31,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 92 states have (on average 1.5) internal successors, (138), 126 states have internal predecessors, (138), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:31,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2024-10-13 10:55:31,542 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 14 [2024-10-13 10:55:31,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:31,542 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2024-10-13 10:55:31,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:31,543 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2024-10-13 10:55:31,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 10:55:31,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:31,543 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:31,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-13 10:55:31,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:31,744 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:31,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:31,745 INFO L85 PathProgramCache]: Analyzing trace with hash -788386787, now seen corresponding path program 1 times [2024-10-13 10:55:31,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:31,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238111869] [2024-10-13 10:55:31,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:31,745 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:31,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:31,748 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:31,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 10:55:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:31,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 10:55:31,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:31,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:55:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:31,909 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:31,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:55:31,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238111869] [2024-10-13 10:55:31,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238111869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:31,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:31,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:55:31,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678582239] [2024-10-13 10:55:31,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:31,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:55:31,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:55:31,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:55:31,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:55:31,911 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:32,368 INFO L93 Difference]: Finished difference Result 169 states and 192 transitions. [2024-10-13 10:55:32,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:55:32,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-13 10:55:32,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:32,370 INFO L225 Difference]: With dead ends: 169 [2024-10-13 10:55:32,370 INFO L226 Difference]: Without dead ends: 169 [2024-10-13 10:55:32,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:55:32,371 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 165 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:32,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 286 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:55:32,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-13 10:55:32,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 135. [2024-10-13 10:55:32,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 99 states have (on average 1.4747474747474747) internal successors, (146), 133 states have internal predecessors, (146), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:32,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 152 transitions. [2024-10-13 10:55:32,375 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 152 transitions. Word has length 17 [2024-10-13 10:55:32,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:32,376 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 152 transitions. [2024-10-13 10:55:32,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:32,376 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 152 transitions. [2024-10-13 10:55:32,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:55:32,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:32,377 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:32,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-13 10:55:32,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:32,578 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:32,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:32,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1577864059, now seen corresponding path program 1 times [2024-10-13 10:55:32,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:32,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142587895] [2024-10-13 10:55:32,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:32,579 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:32,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:32,581 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:32,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 10:55:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:32,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:55:32,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:32,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 10:55:32,752 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 15 treesize of output 1 [2024-10-13 10:55:32,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-13 10:55:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:32,771 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:32,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:55:32,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142587895] [2024-10-13 10:55:32,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142587895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:32,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:32,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:55:32,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738714617] [2024-10-13 10:55:32,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:32,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:55:32,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:55:32,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:55:32,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:32,773 INFO L87 Difference]: Start difference. First operand 135 states and 152 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:33,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:33,172 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2024-10-13 10:55:33,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:55:33,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-13 10:55:33,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:33,173 INFO L225 Difference]: With dead ends: 134 [2024-10-13 10:55:33,173 INFO L226 Difference]: Without dead ends: 134 [2024-10-13 10:55:33,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:55:33,174 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 2 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:33,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 276 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:55:33,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-13 10:55:33,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-13 10:55:33,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 132 states have internal predecessors, (145), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:33,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 151 transitions. [2024-10-13 10:55:33,178 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 151 transitions. Word has length 19 [2024-10-13 10:55:33,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:33,178 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 151 transitions. [2024-10-13 10:55:33,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:33,179 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 151 transitions. [2024-10-13 10:55:33,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:55:33,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:33,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:33,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-13 10:55:33,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:33,381 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:33,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:33,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1577864058, now seen corresponding path program 1 times [2024-10-13 10:55:33,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:33,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1753127294] [2024-10-13 10:55:33,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:33,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:33,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:33,386 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:33,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-13 10:55:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:33,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 10:55:33,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:33,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:55:33,558 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 15 treesize of output 1 [2024-10-13 10:55:33,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:55:33,588 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 17 treesize of output 9 [2024-10-13 10:55:33,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:33,603 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:33,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:55:33,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1753127294] [2024-10-13 10:55:33,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1753127294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:33,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:33,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:55:33,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333670186] [2024-10-13 10:55:33,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:33,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:55:33,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:55:33,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:55:33,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:33,605 INFO L87 Difference]: Start difference. First operand 134 states and 151 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:33,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:33,984 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2024-10-13 10:55:33,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:55:33,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-13 10:55:33,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:33,986 INFO L225 Difference]: With dead ends: 133 [2024-10-13 10:55:33,986 INFO L226 Difference]: Without dead ends: 133 [2024-10-13 10:55:33,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:55:33,987 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 1 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:33,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 264 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:55:33,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-13 10:55:33,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-10-13 10:55:33,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 99 states have (on average 1.4545454545454546) internal successors, (144), 131 states have internal predecessors, (144), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:33,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 150 transitions. [2024-10-13 10:55:33,992 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 150 transitions. Word has length 19 [2024-10-13 10:55:33,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:33,992 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 150 transitions. [2024-10-13 10:55:33,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:33,992 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 150 transitions. [2024-10-13 10:55:33,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 10:55:33,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:33,995 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:34,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-13 10:55:34,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:34,197 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:34,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:34,197 INFO L85 PathProgramCache]: Analyzing trace with hash -14600253, now seen corresponding path program 1 times [2024-10-13 10:55:34,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:34,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747286796] [2024-10-13 10:55:34,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:34,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:34,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:34,199 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:34,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-13 10:55:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:34,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:55:34,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:34,322 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 13 treesize of output 9 [2024-10-13 10:55:34,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:34,335 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:34,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:55:34,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747286796] [2024-10-13 10:55:34,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747286796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:34,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:34,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:55:34,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425989335] [2024-10-13 10:55:34,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:34,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:55:34,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:55:34,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:55:34,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:55:34,336 INFO L87 Difference]: Start difference. First operand 133 states and 150 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:34,528 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2024-10-13 10:55:34,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:55:34,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-13 10:55:34,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:34,529 INFO L225 Difference]: With dead ends: 132 [2024-10-13 10:55:34,529 INFO L226 Difference]: Without dead ends: 132 [2024-10-13 10:55:34,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:34,530 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 14 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:34,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 200 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:34,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-13 10:55:34,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-10-13 10:55:34,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 99 states have (on average 1.4343434343434343) internal successors, (142), 130 states have internal predecessors, (142), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:34,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 147 transitions. [2024-10-13 10:55:34,534 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 147 transitions. Word has length 21 [2024-10-13 10:55:34,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:34,534 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 147 transitions. [2024-10-13 10:55:34,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:34,534 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 147 transitions. [2024-10-13 10:55:34,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 10:55:34,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:34,535 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:34,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-13 10:55:34,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:34,736 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:34,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:34,736 INFO L85 PathProgramCache]: Analyzing trace with hash 941654992, now seen corresponding path program 1 times [2024-10-13 10:55:34,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:34,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311221978] [2024-10-13 10:55:34,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:34,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:34,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:34,738 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:34,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-13 10:55:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:34,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 10:55:34,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:34,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:55:34,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:55:34,912 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 19 treesize of output 18 [2024-10-13 10:55:34,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 10:55:34,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 10:55:34,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-13 10:55:35,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-10-13 10:55:35,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:35,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:55:35,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:35,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:55:35,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311221978] [2024-10-13 10:55:35,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311221978] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:55:35,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:55:35,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2024-10-13 10:55:35,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734037376] [2024-10-13 10:55:35,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:55:35,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:55:35,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:55:35,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:55:35,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:55:35,382 INFO L87 Difference]: Start difference. First operand 132 states and 147 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:36,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:36,250 INFO L93 Difference]: Finished difference Result 165 states and 189 transitions. [2024-10-13 10:55:36,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:55:36,251 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-13 10:55:36,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:36,252 INFO L225 Difference]: With dead ends: 165 [2024-10-13 10:55:36,252 INFO L226 Difference]: Without dead ends: 165 [2024-10-13 10:55:36,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-10-13 10:55:36,253 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 287 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:36,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 282 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 10:55:36,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-13 10:55:36,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 158. [2024-10-13 10:55:36,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 125 states have (on average 1.44) internal successors, (180), 156 states have internal predecessors, (180), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:36,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 185 transitions. [2024-10-13 10:55:36,257 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 185 transitions. Word has length 21 [2024-10-13 10:55:36,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:36,258 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 185 transitions. [2024-10-13 10:55:36,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:36,258 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 185 transitions. [2024-10-13 10:55:36,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 10:55:36,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:36,259 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:36,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-13 10:55:36,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:36,463 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:36,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:36,463 INFO L85 PathProgramCache]: Analyzing trace with hash -203654580, now seen corresponding path program 1 times [2024-10-13 10:55:36,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:36,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583307996] [2024-10-13 10:55:36,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:36,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:36,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:36,468 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:36,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-13 10:55:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:36,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 10:55:36,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:36,704 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-13 10:55:36,704 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 19 treesize of output 27 [2024-10-13 10:55:36,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:55:36,790 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:55:36,791 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 36 treesize of output 35 [2024-10-13 10:55:36,805 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 27 treesize of output 15 [2024-10-13 10:55:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:36,829 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:36,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:55:36,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583307996] [2024-10-13 10:55:36,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583307996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:36,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:36,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:55:36,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492492910] [2024-10-13 10:55:36,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:36,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:55:36,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:55:36,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:55:36,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:55:36,831 INFO L87 Difference]: Start difference. First operand 158 states and 185 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:37,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:37,248 INFO L93 Difference]: Finished difference Result 160 states and 187 transitions. [2024-10-13 10:55:37,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:55:37,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-13 10:55:37,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:37,250 INFO L225 Difference]: With dead ends: 160 [2024-10-13 10:55:37,250 INFO L226 Difference]: Without dead ends: 160 [2024-10-13 10:55:37,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:55:37,250 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 17 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:37,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 196 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:55:37,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-13 10:55:37,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2024-10-13 10:55:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 125 states have (on average 1.432) internal successors, (179), 155 states have internal predecessors, (179), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:37,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 184 transitions. [2024-10-13 10:55:37,255 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 184 transitions. Word has length 21 [2024-10-13 10:55:37,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:37,255 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 184 transitions. [2024-10-13 10:55:37,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:37,255 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 184 transitions. [2024-10-13 10:55:37,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 10:55:37,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:37,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:37,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-13 10:55:37,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:37,457 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:37,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:37,457 INFO L85 PathProgramCache]: Analyzing trace with hash -203654579, now seen corresponding path program 1 times [2024-10-13 10:55:37,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:37,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852438728] [2024-10-13 10:55:37,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:37,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:37,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:37,461 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:37,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-13 10:55:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:37,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-13 10:55:37,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:37,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 10:55:37,703 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-13 10:55:37,703 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 19 treesize of output 27 [2024-10-13 10:55:37,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:55:37,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:55:37,811 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:55:37,812 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 45 treesize of output 42 [2024-10-13 10:55:37,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-10-13 10:55:37,928 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-10-13 10:55:37,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-13 10:55:37,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2024-10-13 10:55:37,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:55:37,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:55:38,057 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:55:38,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-13 10:55:38,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-13 10:55:38,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-13 10:55:38,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-13 10:55:38,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:38,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:38,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:55:38,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852438728] [2024-10-13 10:55:38,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [852438728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:38,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:38,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 10:55:38,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606200585] [2024-10-13 10:55:38,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:38,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 10:55:38,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:55:38,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 10:55:38,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:55:38,141 INFO L87 Difference]: Start difference. First operand 157 states and 184 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:39,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:39,593 INFO L93 Difference]: Finished difference Result 157 states and 184 transitions. [2024-10-13 10:55:39,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 10:55:39,594 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-13 10:55:39,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:39,595 INFO L225 Difference]: With dead ends: 157 [2024-10-13 10:55:39,595 INFO L226 Difference]: Without dead ends: 157 [2024-10-13 10:55:39,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2024-10-13 10:55:39,596 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 124 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:39,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 354 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 10:55:39,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-13 10:55:39,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 136. [2024-10-13 10:55:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 111 states have (on average 1.3963963963963963) internal successors, (155), 134 states have internal predecessors, (155), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:39,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 160 transitions. [2024-10-13 10:55:39,599 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 160 transitions. Word has length 21 [2024-10-13 10:55:39,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:39,600 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 160 transitions. [2024-10-13 10:55:39,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:39,600 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 160 transitions. [2024-10-13 10:55:39,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 10:55:39,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:39,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:39,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-13 10:55:39,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:39,801 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:39,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:39,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1720838367, now seen corresponding path program 1 times [2024-10-13 10:55:39,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:39,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477460612] [2024-10-13 10:55:39,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:39,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:39,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:39,803 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:39,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-13 10:55:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:39,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 10:55:39,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:39,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:55:39,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:39,961 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:39,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:55:39,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477460612] [2024-10-13 10:55:39,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477460612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:39,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:39,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:55:39,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990746040] [2024-10-13 10:55:39,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:39,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:55:39,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:55:39,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:55:39,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:55:39,965 INFO L87 Difference]: Start difference. First operand 136 states and 160 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:40,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:40,237 INFO L93 Difference]: Finished difference Result 139 states and 162 transitions. [2024-10-13 10:55:40,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:55:40,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-13 10:55:40,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:40,239 INFO L225 Difference]: With dead ends: 139 [2024-10-13 10:55:40,239 INFO L226 Difference]: Without dead ends: 139 [2024-10-13 10:55:40,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:55:40,239 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 107 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:40,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 250 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:55:40,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-13 10:55:40,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 134. [2024-10-13 10:55:40,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 109 states have (on average 1.3944954128440368) internal successors, (152), 132 states have internal predecessors, (152), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 157 transitions. [2024-10-13 10:55:40,244 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 157 transitions. Word has length 23 [2024-10-13 10:55:40,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:40,244 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 157 transitions. [2024-10-13 10:55:40,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2024-10-13 10:55:40,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:55:40,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:40,244 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:40,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-10-13 10:55:40,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:40,445 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:40,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:40,445 INFO L85 PathProgramCache]: Analyzing trace with hash 919714024, now seen corresponding path program 1 times [2024-10-13 10:55:40,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:40,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122088872] [2024-10-13 10:55:40,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:40,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:40,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:40,449 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:40,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-13 10:55:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:40,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 10:55:40,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:40,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:55:40,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:55:40,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-13 10:55:40,735 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-10-13 10:55:40,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-13 10:55:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:40,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:40,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:55:40,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122088872] [2024-10-13 10:55:40,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122088872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:40,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:40,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:55:40,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545537153] [2024-10-13 10:55:40,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:40,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:55:40,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:55:40,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:55:40,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:40,798 INFO L87 Difference]: Start difference. First operand 134 states and 157 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:41,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:41,107 INFO L93 Difference]: Finished difference Result 134 states and 156 transitions. [2024-10-13 10:55:41,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:55:41,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-13 10:55:41,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:41,108 INFO L225 Difference]: With dead ends: 134 [2024-10-13 10:55:41,108 INFO L226 Difference]: Without dead ends: 134 [2024-10-13 10:55:41,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:55:41,108 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 79 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:41,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 171 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:55:41,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-13 10:55:41,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2024-10-13 10:55:41,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 109 states have (on average 1.385321100917431) internal successors, (151), 131 states have internal predecessors, (151), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:41,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2024-10-13 10:55:41,112 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 24 [2024-10-13 10:55:41,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:41,112 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2024-10-13 10:55:41,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:41,112 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2024-10-13 10:55:41,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:55:41,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:41,113 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:41,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-10-13 10:55:41,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:41,313 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:41,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:41,314 INFO L85 PathProgramCache]: Analyzing trace with hash -971944067, now seen corresponding path program 1 times [2024-10-13 10:55:41,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:41,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55643738] [2024-10-13 10:55:41,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:41,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:41,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:41,316 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:41,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-13 10:55:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:41,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 10:55:41,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:41,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 10:55:41,521 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-13 10:55:41,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-10-13 10:55:41,573 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2024-10-13 10:55:41,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2024-10-13 10:55:41,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:55:41,642 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:55:41,643 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 33 treesize of output 32 [2024-10-13 10:55:41,651 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 24 treesize of output 12 [2024-10-13 10:55:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:41,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:41,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:55:41,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55643738] [2024-10-13 10:55:41,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55643738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:41,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:41,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:55:41,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301720337] [2024-10-13 10:55:41,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:41,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:55:41,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:55:41,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:55:41,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:55:41,677 INFO L87 Difference]: Start difference. First operand 133 states and 155 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:42,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:42,347 INFO L93 Difference]: Finished difference Result 156 states and 179 transitions. [2024-10-13 10:55:42,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:55:42,348 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-13 10:55:42,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:42,348 INFO L225 Difference]: With dead ends: 156 [2024-10-13 10:55:42,349 INFO L226 Difference]: Without dead ends: 156 [2024-10-13 10:55:42,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2024-10-13 10:55:42,350 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 200 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:42,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 226 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:55:42,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-13 10:55:42,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 140. [2024-10-13 10:55:42,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 138 states have internal predecessors, (158), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:42,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 162 transitions. [2024-10-13 10:55:42,353 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 162 transitions. Word has length 26 [2024-10-13 10:55:42,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:42,354 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 162 transitions. [2024-10-13 10:55:42,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:42,354 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 162 transitions. [2024-10-13 10:55:42,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:55:42,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:42,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:42,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-10-13 10:55:42,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:42,555 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:42,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:42,556 INFO L85 PathProgramCache]: Analyzing trace with hash -598426252, now seen corresponding path program 1 times [2024-10-13 10:55:42,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:42,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000580393] [2024-10-13 10:55:42,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:42,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:42,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:42,557 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:42,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-13 10:55:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:42,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 10:55:42,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:42,671 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 13 treesize of output 9 [2024-10-13 10:55:42,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:55:42,703 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:42,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:55:42,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000580393] [2024-10-13 10:55:42,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000580393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:42,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:42,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:55:42,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637731754] [2024-10-13 10:55:42,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:42,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:55:42,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:55:42,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:55:42,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:55:42,704 INFO L87 Difference]: Start difference. First operand 140 states and 162 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:42,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:42,869 INFO L93 Difference]: Finished difference Result 135 states and 153 transitions. [2024-10-13 10:55:42,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:55:42,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-13 10:55:42,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:42,870 INFO L225 Difference]: With dead ends: 135 [2024-10-13 10:55:42,870 INFO L226 Difference]: Without dead ends: 135 [2024-10-13 10:55:42,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:42,871 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 4 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:42,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 202 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:42,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-13 10:55:42,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-10-13 10:55:42,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 110 states have (on average 1.3454545454545455) internal successors, (148), 132 states have internal predecessors, (148), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:42,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 152 transitions. [2024-10-13 10:55:42,873 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 152 transitions. Word has length 26 [2024-10-13 10:55:42,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:42,873 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 152 transitions. [2024-10-13 10:55:42,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:42,874 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 152 transitions. [2024-10-13 10:55:42,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:55:42,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:42,874 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:42,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-10-13 10:55:43,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:43,076 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:43,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:43,076 INFO L85 PathProgramCache]: Analyzing trace with hash -597761497, now seen corresponding path program 1 times [2024-10-13 10:55:43,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:43,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086882527] [2024-10-13 10:55:43,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:43,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:43,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:43,078 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:43,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-10-13 10:55:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:43,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 10:55:43,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:43,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:55:43,213 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:43,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:55:43,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086882527] [2024-10-13 10:55:43,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086882527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:43,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:43,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:55:43,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360075109] [2024-10-13 10:55:43,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:43,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:55:43,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:55:43,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:55:43,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:43,214 INFO L87 Difference]: Start difference. First operand 134 states and 152 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:43,306 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2024-10-13 10:55:43,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:55:43,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-13 10:55:43,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:43,307 INFO L225 Difference]: With dead ends: 138 [2024-10-13 10:55:43,307 INFO L226 Difference]: Without dead ends: 138 [2024-10-13 10:55:43,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:43,308 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 45 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:43,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 92 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:43,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-13 10:55:43,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-10-13 10:55:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 114 states have (on average 1.3245614035087718) internal successors, (151), 136 states have internal predecessors, (151), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 155 transitions. [2024-10-13 10:55:43,312 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 155 transitions. Word has length 26 [2024-10-13 10:55:43,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:43,312 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 155 transitions. [2024-10-13 10:55:43,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:43,312 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions. [2024-10-13 10:55:43,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 10:55:43,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:43,313 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:43,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-10-13 10:55:43,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:43,514 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:43,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:43,514 INFO L85 PathProgramCache]: Analyzing trace with hash -978016469, now seen corresponding path program 1 times [2024-10-13 10:55:43,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:43,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684997965] [2024-10-13 10:55:43,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:43,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:43,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:43,518 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:43,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-10-13 10:55:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:43,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 10:55:43,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:43,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-13 10:55:43,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:43,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:55:44,005 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-13 10:55:44,005 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 19 treesize of output 19 [2024-10-13 10:55:44,019 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-13 10:55:44,019 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 20 treesize of output 12 [2024-10-13 10:55:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:44,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:55:44,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684997965] [2024-10-13 10:55:44,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684997965] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:55:44,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:55:44,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-10-13 10:55:44,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288311463] [2024-10-13 10:55:44,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:55:44,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 10:55:44,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:55:44,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 10:55:44,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:55:44,079 INFO L87 Difference]: Start difference. First operand 138 states and 155 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:44,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:44,857 INFO L93 Difference]: Finished difference Result 163 states and 187 transitions. [2024-10-13 10:55:44,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:55:44,858 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-13 10:55:44,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:44,859 INFO L225 Difference]: With dead ends: 163 [2024-10-13 10:55:44,859 INFO L226 Difference]: Without dead ends: 163 [2024-10-13 10:55:44,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-13 10:55:44,859 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 161 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:44,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 312 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 10:55:44,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-13 10:55:44,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 142. [2024-10-13 10:55:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 118 states have (on average 1.2966101694915255) internal successors, (153), 140 states have internal predecessors, (153), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2024-10-13 10:55:44,862 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 29 [2024-10-13 10:55:44,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:44,863 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2024-10-13 10:55:44,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2024-10-13 10:55:44,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 10:55:44,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:44,863 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:44,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-10-13 10:55:45,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:45,064 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-13 10:55:45,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:45,064 INFO L85 PathProgramCache]: Analyzing trace with hash -253739806, now seen corresponding path program 1 times [2024-10-13 10:55:45,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:55:45,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169597950] [2024-10-13 10:55:45,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:45,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:45,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:55:45,066 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:55:45,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-10-13 10:55:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 10:55:45,207 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 10:55:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 10:55:45,306 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-13 10:55:45,306 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 10:55:45,311 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK (70 of 71 remaining) [2024-10-13 10:55:45,313 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (69 of 71 remaining) [2024-10-13 10:55:45,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 71 remaining) [2024-10-13 10:55:45,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 71 remaining) [2024-10-13 10:55:45,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 71 remaining) [2024-10-13 10:55:45,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 71 remaining) [2024-10-13 10:55:45,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 71 remaining) [2024-10-13 10:55:45,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 71 remaining) [2024-10-13 10:55:45,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 71 remaining) [2024-10-13 10:55:45,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 71 remaining) [2024-10-13 10:55:45,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 71 remaining) [2024-10-13 10:55:45,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 71 remaining) [2024-10-13 10:55:45,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 71 remaining) [2024-10-13 10:55:45,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 71 remaining) [2024-10-13 10:55:45,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 71 remaining) [2024-10-13 10:55:45,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 71 remaining) [2024-10-13 10:55:45,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 71 remaining) [2024-10-13 10:55:45,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 71 remaining) [2024-10-13 10:55:45,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 71 remaining) [2024-10-13 10:55:45,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 71 remaining) [2024-10-13 10:55:45,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 71 remaining) [2024-10-13 10:55:45,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 71 remaining) [2024-10-13 10:55:45,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 71 remaining) [2024-10-13 10:55:45,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 71 remaining) [2024-10-13 10:55:45,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 71 remaining) [2024-10-13 10:55:45,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 71 remaining) [2024-10-13 10:55:45,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 71 remaining) [2024-10-13 10:55:45,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 71 remaining) [2024-10-13 10:55:45,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 71 remaining) [2024-10-13 10:55:45,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 71 remaining) [2024-10-13 10:55:45,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 71 remaining) [2024-10-13 10:55:45,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 71 remaining) [2024-10-13 10:55:45,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 71 remaining) [2024-10-13 10:55:45,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 71 remaining) [2024-10-13 10:55:45,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 71 remaining) [2024-10-13 10:55:45,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 71 remaining) [2024-10-13 10:55:45,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 71 remaining) [2024-10-13 10:55:45,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 71 remaining) [2024-10-13 10:55:45,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 71 remaining) [2024-10-13 10:55:45,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 71 remaining) [2024-10-13 10:55:45,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 71 remaining) [2024-10-13 10:55:45,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 71 remaining) [2024-10-13 10:55:45,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 71 remaining) [2024-10-13 10:55:45,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 71 remaining) [2024-10-13 10:55:45,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 71 remaining) [2024-10-13 10:55:45,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 71 remaining) [2024-10-13 10:55:45,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 71 remaining) [2024-10-13 10:55:45,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 71 remaining) [2024-10-13 10:55:45,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 71 remaining) [2024-10-13 10:55:45,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 71 remaining) [2024-10-13 10:55:45,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 71 remaining) [2024-10-13 10:55:45,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 71 remaining) [2024-10-13 10:55:45,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 71 remaining) [2024-10-13 10:55:45,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 71 remaining) [2024-10-13 10:55:45,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 71 remaining) [2024-10-13 10:55:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 71 remaining) [2024-10-13 10:55:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 71 remaining) [2024-10-13 10:55:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 71 remaining) [2024-10-13 10:55:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE (12 of 71 remaining) [2024-10-13 10:55:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE (11 of 71 remaining) [2024-10-13 10:55:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE (10 of 71 remaining) [2024-10-13 10:55:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 71 remaining) [2024-10-13 10:55:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 71 remaining) [2024-10-13 10:55:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE (7 of 71 remaining) [2024-10-13 10:55:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE (6 of 71 remaining) [2024-10-13 10:55:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (5 of 71 remaining) [2024-10-13 10:55:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 71 remaining) [2024-10-13 10:55:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 71 remaining) [2024-10-13 10:55:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE (2 of 71 remaining) [2024-10-13 10:55:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE (1 of 71 remaining) [2024-10-13 10:55:45,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE (0 of 71 remaining) [2024-10-13 10:55:45,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-10-13 10:55:45,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:55:45,523 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:45,547 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 10:55:45,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:55:45 BoogieIcfgContainer [2024-10-13 10:55:45,551 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 10:55:45,551 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 10:55:45,551 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 10:55:45,551 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 10:55:45,552 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:55:22" (3/4) ... [2024-10-13 10:55:45,554 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 10:55:45,556 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 10:55:45,556 INFO L158 Benchmark]: Toolchain (without parser) took 25033.49ms. Allocated memory was 60.8MB in the beginning and 107.0MB in the end (delta: 46.1MB). Free memory was 31.0MB in the beginning and 72.9MB in the end (delta: -41.9MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2024-10-13 10:55:45,557 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 44.0MB. Free memory was 20.6MB in the beginning and 20.5MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:55:45,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.53ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 30.9MB in the beginning and 38.9MB in the end (delta: -8.0MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2024-10-13 10:55:45,557 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.20ms. Allocated memory is still 73.4MB. Free memory was 38.9MB in the beginning and 36.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:55:45,557 INFO L158 Benchmark]: Boogie Preprocessor took 65.44ms. Allocated memory is still 73.4MB. Free memory was 36.6MB in the beginning and 33.1MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:55:45,558 INFO L158 Benchmark]: RCFGBuilder took 927.98ms. Allocated memory is still 73.4MB. Free memory was 33.1MB in the beginning and 30.4MB in the end (delta: 2.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 10:55:45,558 INFO L158 Benchmark]: TraceAbstraction took 23444.49ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 30.1MB in the beginning and 74.0MB in the end (delta: -43.9MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. [2024-10-13 10:55:45,559 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 107.0MB. Free memory was 74.0MB in the beginning and 72.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:55:45,560 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 44.0MB. Free memory was 20.6MB in the beginning and 20.5MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 526.53ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 30.9MB in the beginning and 38.9MB in the end (delta: -8.0MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.20ms. Allocated memory is still 73.4MB. Free memory was 38.9MB in the beginning and 36.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.44ms. Allocated memory is still 73.4MB. Free memory was 36.6MB in the beginning and 33.1MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 927.98ms. Allocated memory is still 73.4MB. Free memory was 33.1MB in the beginning and 30.4MB in the end (delta: 2.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 23444.49ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 30.1MB in the beginning and 74.0MB in the end (delta: -43.9MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 107.0MB. Free memory was 74.0MB in the beginning and 72.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 996]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 996. Possible FailurePath: [L998] struct TSLL* null = malloc(sizeof(struct TSLL)); [L999] null->next = ((void*)0) [L1000] null->prev = ((void*)0) [L1001] null->colour = BLACK [L1003] struct TSLL* list = malloc(sizeof(struct TSLL)); [L1004] list->next = null [L1005] list->prev = null [L1006] list->colour = BLACK [L1008] struct TSLL* end = list; VAL [end={3:0}, list={3:0}, null={6:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1037] end = null [L1038] end = list VAL [end={3:0}, list={3:0}, null={6:0}] [L1041] COND FALSE !(!(null != end)) VAL [end={3:0}, list={3:0}, null={6:0}] [L1042] EXPR end->colour [L1042] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE null != end VAL [end={3:0}, list={3:0}, null={6:0}] [L1045] EXPR end->colour [L1045] COND FALSE !(RED == end->colour) [L1052] EXPR end->next [L1052] end = end->next [L1043] COND FALSE !(null != end) VAL [list={3:0}, null={6:0}] [L1056] COND TRUE null != list VAL [list={3:0}, null={6:0}] [L1058] EXPR list->colour [L1058] COND FALSE !(RED == list->colour) [L1067] EXPR list->next [L1067] end = list->next [L1068] free(list) VAL [end={6:0}, null={6:0}] [L1068] free(list) VAL [end={6:0}, null={6:0}] [L1068] free(list) [L1069] list = end VAL [list={6:0}, null={6:0}] [L1056] COND FALSE !(null != list) [L1073] return 0; VAL [\result=0] - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 154 locations, 71 error locations. Started 1 CEGAR loops. OverallTime: 23.4s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2495 SdHoareTripleChecker+Valid, 10.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2495 mSDsluCounter, 4797 SdHoareTripleChecker+Invalid, 8.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3041 mSDsCounter, 195 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5263 IncrementalHoareTripleChecker+Invalid, 5458 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 195 mSolverCounterUnsat, 1756 mSDtfsCounter, 5263 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 479 GetRequests, 324 SyntacticMatches, 2 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=16, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 202 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 423 NumberOfCodeBlocks, 423 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 417 ConstructedInterpolants, 6 QuantifiedInterpolants, 3088 SizeOfPredicates, 67 NumberOfNonLiveVariables, 3471 ConjunctsInSsa, 230 ConjunctsInUnsatCore, 26 InterpolantComputations, 22 PerfectInterpolantSequences, 6/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 10:55:45,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample