/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/float-benchs/filter_iir.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:42:06,517 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:42:06,520 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:42:06,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:42:06,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:42:06,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:42:06,580 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:42:06,598 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:42:06,601 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:42:06,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:42:06,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:42:06,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:42:06,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:42:06,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:42:06,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:42:06,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:42:06,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:42:06,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:42:06,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:42:06,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:42:06,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:42:06,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:42:06,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:42:06,645 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:42:06,654 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:42:06,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:42:06,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:42:06,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:42:06,658 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:42:06,659 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:42:06,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:42:06,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:42:06,662 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:42:06,663 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:42:06,664 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:42:06,665 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:42:06,665 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:42:06,666 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:42:06,666 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:42:06,667 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:42:06,668 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:42:06,669 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 16:42:06,726 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:42:06,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:42:06,726 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:42:06,727 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:42:06,728 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:42:06,728 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:42:06,729 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:42:06,729 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:42:06,729 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:42:06,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:42:06,730 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:42:06,730 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:42:06,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:42:06,730 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:42:06,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:42:06,731 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:42:06,731 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:42:06,731 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:42:06,731 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:42:06,732 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:42:06,732 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:42:06,732 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:42:06,732 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:42:06,732 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:42:06,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:42:06,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:42:06,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:42:06,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:42:06,733 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:42:06,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:42:06,734 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-10-15 16:42:07,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:42:07,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:42:07,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:42:07,132 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:42:07,133 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:42:07,135 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter_iir.c [2022-10-15 16:42:07,224 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc7d723f0/60c4a5816b3149e48d0b3c0aa340cbad/FLAGb316e5c61 [2022-10-15 16:42:07,969 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:42:07,974 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter_iir.c [2022-10-15 16:42:07,982 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc7d723f0/60c4a5816b3149e48d0b3c0aa340cbad/FLAGb316e5c61 [2022-10-15 16:42:08,298 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc7d723f0/60c4a5816b3149e48d0b3c0aa340cbad [2022-10-15 16:42:08,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:42:08,309 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:42:08,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:42:08,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:42:08,319 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:42:08,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:42:08" (1/1) ... [2022-10-15 16:42:08,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e83000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:08, skipping insertion in model container [2022-10-15 16:42:08,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:42:08" (1/1) ... [2022-10-15 16:42:08,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:42:08,356 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:42:08,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter_iir.c[583,596] [2022-10-15 16:42:08,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:42:08,620 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:42:08,651 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter_iir.c[583,596] [2022-10-15 16:42:08,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:42:08,735 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:42:08,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:08 WrapperNode [2022-10-15 16:42:08,738 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:42:08,740 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:42:08,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:42:08,746 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:42:08,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:08" (1/1) ... [2022-10-15 16:42:08,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:08" (1/1) ... [2022-10-15 16:42:08,843 INFO L138 Inliner]: procedures = 18, calls = 70, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2022-10-15 16:42:08,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:42:08,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:42:08,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:42:08,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:42:08,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:08" (1/1) ... [2022-10-15 16:42:08,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:08" (1/1) ... [2022-10-15 16:42:08,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:08" (1/1) ... [2022-10-15 16:42:08,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:08" (1/1) ... [2022-10-15 16:42:08,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:08" (1/1) ... [2022-10-15 16:42:08,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:08" (1/1) ... [2022-10-15 16:42:08,920 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:08" (1/1) ... [2022-10-15 16:42:08,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:08" (1/1) ... [2022-10-15 16:42:08,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:42:08,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:42:08,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:42:08,940 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:42:08,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:08" (1/1) ... [2022-10-15 16:42:08,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:42:08,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:42:08,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 16:42:09,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 16:42:09,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:42:09,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:42:09,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:42:09,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:42:09,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:42:09,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:42:09,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-10-15 16:42:09,257 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:42:09,260 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:42:10,049 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:42:10,063 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:42:10,064 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-15 16:42:10,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:42:10 BoogieIcfgContainer [2022-10-15 16:42:10,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:42:10,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:42:10,075 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:42:10,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:42:10,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:42:08" (1/3) ... [2022-10-15 16:42:10,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f58cd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:42:10, skipping insertion in model container [2022-10-15 16:42:10,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:08" (2/3) ... [2022-10-15 16:42:10,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f58cd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:42:10, skipping insertion in model container [2022-10-15 16:42:10,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:42:10" (3/3) ... [2022-10-15 16:42:10,090 INFO L112 eAbstractionObserver]: Analyzing ICFG filter_iir.c [2022-10-15 16:42:10,115 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:42:10,116 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 74 error locations. [2022-10-15 16:42:10,183 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:42:10,194 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@138b3355, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:42:10,194 INFO L358 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2022-10-15 16:42:10,201 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 64 states have (on average 2.25) internal successors, (144), 138 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:10,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 16:42:10,210 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:10,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 16:42:10,212 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2022-10-15 16:42:10,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:10,220 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-10-15 16:42:10,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:10,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450557880] [2022-10-15 16:42:10,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:10,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:10,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:42:10,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:10,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450557880] [2022-10-15 16:42:10,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450557880] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:10,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:10,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-15 16:42:10,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258746196] [2022-10-15 16:42:10,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:10,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:42:10,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:10,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:42:10,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:42:10,625 INFO L87 Difference]: Start difference. First operand has 139 states, 64 states have (on average 2.25) internal successors, (144), 138 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:10,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:10,798 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2022-10-15 16:42:10,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:42:10,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-10-15 16:42:10,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:10,816 INFO L225 Difference]: With dead ends: 125 [2022-10-15 16:42:10,817 INFO L226 Difference]: Without dead ends: 125 [2022-10-15 16:42:10,820 INFO L412 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 [2022-10-15 16:42:10,825 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 125 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:10,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 54 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:42:10,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-10-15 16:42:10,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-10-15 16:42:10,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 61 states have (on average 2.081967213114754) internal successors, (127), 124 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 127 transitions. [2022-10-15 16:42:10,885 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 127 transitions. Word has length 3 [2022-10-15 16:42:10,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:10,885 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 127 transitions. [2022-10-15 16:42:10,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2022-10-15 16:42:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 16:42:10,887 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:10,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 16:42:10,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:42:10,888 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2022-10-15 16:42:10,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:10,889 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-10-15 16:42:10,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:10,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541474026] [2022-10-15 16:42:10,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:10,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:42:11,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:11,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541474026] [2022-10-15 16:42:11,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541474026] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:11,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:11,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-15 16:42:11,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942926860] [2022-10-15 16:42:11,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:11,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:42:11,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:11,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:42:11,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:42:11,160 INFO L87 Difference]: Start difference. First operand 125 states and 127 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:11,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:11,282 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2022-10-15 16:42:11,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:42:11,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-10-15 16:42:11,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:11,285 INFO L225 Difference]: With dead ends: 116 [2022-10-15 16:42:11,286 INFO L226 Difference]: Without dead ends: 116 [2022-10-15 16:42:11,286 INFO L412 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 [2022-10-15 16:42:11,288 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 116 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:11,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 55 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:42:11,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-10-15 16:42:11,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-10-15 16:42:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 61 states have (on average 1.9344262295081966) internal successors, (118), 115 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2022-10-15 16:42:11,302 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 3 [2022-10-15 16:42:11,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:11,302 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2022-10-15 16:42:11,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:11,303 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-10-15 16:42:11,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:42:11,303 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:11,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:42:11,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:42:11,304 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2022-10-15 16:42:11,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:11,305 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2022-10-15 16:42:11,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:11,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662957627] [2022-10-15 16:42:11,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:11,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:11,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:42:11,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:11,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662957627] [2022-10-15 16:42:11,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662957627] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:11,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:11,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-15 16:42:11,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049221485] [2022-10-15 16:42:11,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:11,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:42:11,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:11,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:42:11,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:42:11,406 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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) [2022-10-15 16:42:11,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:11,533 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2022-10-15 16:42:11,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:42:11,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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 [2022-10-15 16:42:11,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:11,536 INFO L225 Difference]: With dead ends: 107 [2022-10-15 16:42:11,536 INFO L226 Difference]: Without dead ends: 107 [2022-10-15 16:42:11,536 INFO L412 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 [2022-10-15 16:42:11,538 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 105 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:11,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 45 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:42:11,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-10-15 16:42:11,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-10-15 16:42:11,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 61 states have (on average 1.7868852459016393) internal successors, (109), 106 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:11,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2022-10-15 16:42:11,550 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 5 [2022-10-15 16:42:11,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:11,550 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2022-10-15 16:42:11,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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) [2022-10-15 16:42:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2022-10-15 16:42:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:42:11,551 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:11,551 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:42:11,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:42:11,552 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2022-10-15 16:42:11,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:11,553 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2022-10-15 16:42:11,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:11,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607274241] [2022-10-15 16:42:11,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:11,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:11,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:42:11,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:11,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607274241] [2022-10-15 16:42:11,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607274241] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:11,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:11,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-15 16:42:11,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137230741] [2022-10-15 16:42:11,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:11,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:42:11,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:11,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:42:11,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:42:11,701 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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) [2022-10-15 16:42:11,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:11,812 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2022-10-15 16:42:11,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:42:11,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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 [2022-10-15 16:42:11,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:11,814 INFO L225 Difference]: With dead ends: 98 [2022-10-15 16:42:11,814 INFO L226 Difference]: Without dead ends: 98 [2022-10-15 16:42:11,815 INFO L412 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 [2022-10-15 16:42:11,816 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:11,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 46 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:42:11,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-10-15 16:42:11,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-10-15 16:42:11,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.639344262295082) internal successors, (100), 97 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:11,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2022-10-15 16:42:11,826 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 5 [2022-10-15 16:42:11,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:11,826 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2022-10-15 16:42:11,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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) [2022-10-15 16:42:11,827 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2022-10-15 16:42:11,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 16:42:11,827 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:11,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:42:11,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:42:11,828 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2022-10-15 16:42:11,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:11,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026983, now seen corresponding path program 1 times [2022-10-15 16:42:11,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:11,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789169249] [2022-10-15 16:42:11,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:11,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:11,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:42:11,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:11,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789169249] [2022-10-15 16:42:11,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789169249] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:11,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:11,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-15 16:42:11,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075425896] [2022-10-15 16:42:11,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:11,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:42:11,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:11,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:42:11,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:42:11,913 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:12,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:12,002 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2022-10-15 16:42:12,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:42:12,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-15 16:42:12,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:12,004 INFO L225 Difference]: With dead ends: 95 [2022-10-15 16:42:12,004 INFO L226 Difference]: Without dead ends: 95 [2022-10-15 16:42:12,004 INFO L412 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 [2022-10-15 16:42:12,006 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 91 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:12,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 41 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:42:12,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-10-15 16:42:12,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-10-15 16:42:12,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 61 states have (on average 1.5901639344262295) internal successors, (97), 94 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:12,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2022-10-15 16:42:12,015 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 7 [2022-10-15 16:42:12,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:12,016 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2022-10-15 16:42:12,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:12,016 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-10-15 16:42:12,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 16:42:12,017 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:12,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:42:12,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:42:12,018 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2022-10-15 16:42:12,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:12,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026984, now seen corresponding path program 1 times [2022-10-15 16:42:12,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:12,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434773451] [2022-10-15 16:42:12,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:12,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:12,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:42:12,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:12,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434773451] [2022-10-15 16:42:12,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434773451] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:12,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:12,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-15 16:42:12,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401389197] [2022-10-15 16:42:12,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:12,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:42:12,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:12,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:42:12,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:42:12,209 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:12,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:12,285 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-10-15 16:42:12,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:42:12,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-15 16:42:12,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:12,287 INFO L225 Difference]: With dead ends: 92 [2022-10-15 16:42:12,287 INFO L226 Difference]: Without dead ends: 92 [2022-10-15 16:42:12,287 INFO L412 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 [2022-10-15 16:42:12,289 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 88 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:12,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 42 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:42:12,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-10-15 16:42:12,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-10-15 16:42:12,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.540983606557377) internal successors, (94), 91 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:12,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2022-10-15 16:42:12,296 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 7 [2022-10-15 16:42:12,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:12,297 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2022-10-15 16:42:12,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:12,297 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-10-15 16:42:12,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 16:42:12,298 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:12,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:42:12,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:42:12,299 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2022-10-15 16:42:12,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:12,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1837110248, now seen corresponding path program 1 times [2022-10-15 16:42:12,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:12,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303568160] [2022-10-15 16:42:12,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:12,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:12,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:42:12,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:12,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303568160] [2022-10-15 16:42:12,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303568160] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:12,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:12,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-15 16:42:12,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382275529] [2022-10-15 16:42:12,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:12,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:42:12,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:12,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:42:12,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:42:12,390 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:12,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:12,463 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2022-10-15 16:42:12,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:42:12,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-10-15 16:42:12,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:12,464 INFO L225 Difference]: With dead ends: 89 [2022-10-15 16:42:12,465 INFO L226 Difference]: Without dead ends: 89 [2022-10-15 16:42:12,465 INFO L412 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 [2022-10-15 16:42:12,466 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:12,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 38 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:42:12,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-10-15 16:42:12,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-10-15 16:42:12,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 88 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2022-10-15 16:42:12,473 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 9 [2022-10-15 16:42:12,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:12,473 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2022-10-15 16:42:12,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2022-10-15 16:42:12,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 16:42:12,475 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:12,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:42:12,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:42:12,475 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2022-10-15 16:42:12,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:12,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1837110249, now seen corresponding path program 1 times [2022-10-15 16:42:12,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:12,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498337874] [2022-10-15 16:42:12,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:12,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:12,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:42:12,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:12,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498337874] [2022-10-15 16:42:12,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498337874] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:12,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:12,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-15 16:42:12,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387169936] [2022-10-15 16:42:12,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:12,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:42:12,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:12,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:42:12,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:42:12,600 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:12,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:12,666 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2022-10-15 16:42:12,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:42:12,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-10-15 16:42:12,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:12,668 INFO L225 Difference]: With dead ends: 86 [2022-10-15 16:42:12,668 INFO L226 Difference]: Without dead ends: 86 [2022-10-15 16:42:12,668 INFO L412 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 [2022-10-15 16:42:12,669 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:12,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 39 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:42:12,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-10-15 16:42:12,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-10-15 16:42:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 85 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2022-10-15 16:42:12,675 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 9 [2022-10-15 16:42:12,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:12,676 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2022-10-15 16:42:12,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:12,676 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2022-10-15 16:42:12,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 16:42:12,677 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:12,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:42:12,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:42:12,678 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2022-10-15 16:42:12,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:12,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1673946472, now seen corresponding path program 1 times [2022-10-15 16:42:12,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:12,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899796458] [2022-10-15 16:42:12,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:12,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:42:12,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:12,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899796458] [2022-10-15 16:42:12,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899796458] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:12,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:12,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:42:12,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112042278] [2022-10-15 16:42:12,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:12,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:42:12,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:12,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:42:12,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:42:12,781 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:12,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:12,896 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2022-10-15 16:42:12,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:42:12,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-15 16:42:12,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:12,898 INFO L225 Difference]: With dead ends: 96 [2022-10-15 16:42:12,898 INFO L226 Difference]: Without dead ends: 96 [2022-10-15 16:42:12,899 INFO L412 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 [2022-10-15 16:42:12,902 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 158 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:12,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 53 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:42:12,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-10-15 16:42:12,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 85. [2022-10-15 16:42:12,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 84 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:12,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2022-10-15 16:42:12,915 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 17 [2022-10-15 16:42:12,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:12,916 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2022-10-15 16:42:12,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2022-10-15 16:42:12,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 16:42:12,917 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:12,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:42:12,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 16:42:12,918 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2022-10-15 16:42:12,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:12,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1673946471, now seen corresponding path program 1 times [2022-10-15 16:42:12,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:12,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963707537] [2022-10-15 16:42:12,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:12,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:13,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:42:13,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:13,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963707537] [2022-10-15 16:42:13,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963707537] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:13,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:13,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:42:13,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004977246] [2022-10-15 16:42:13,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:13,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:42:13,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:13,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:42:13,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:42:13,181 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:13,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:13,281 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-10-15 16:42:13,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:42:13,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-15 16:42:13,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:13,283 INFO L225 Difference]: With dead ends: 95 [2022-10-15 16:42:13,283 INFO L226 Difference]: Without dead ends: 95 [2022-10-15 16:42:13,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:42:13,284 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 149 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:13,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 55 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:42:13,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-10-15 16:42:13,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2022-10-15 16:42:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 83 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:13,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2022-10-15 16:42:13,289 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 17 [2022-10-15 16:42:13,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:13,289 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2022-10-15 16:42:13,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-10-15 16:42:13,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 16:42:13,290 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:13,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:42:13,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:42:13,291 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2022-10-15 16:42:13,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:13,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1950177241, now seen corresponding path program 1 times [2022-10-15 16:42:13,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:13,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544223947] [2022-10-15 16:42:13,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:13,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:13,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:42:13,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:13,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544223947] [2022-10-15 16:42:13,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544223947] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:13,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:13,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-15 16:42:13,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560433622] [2022-10-15 16:42:13,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:13,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:42:13,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:13,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:42:13,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:42:13,401 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 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) [2022-10-15 16:42:13,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:13,464 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2022-10-15 16:42:13,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:42:13,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 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 [2022-10-15 16:42:13,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:13,465 INFO L225 Difference]: With dead ends: 82 [2022-10-15 16:42:13,465 INFO L226 Difference]: Without dead ends: 82 [2022-10-15 16:42:13,466 INFO L412 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 [2022-10-15 16:42:13,467 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 66 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:13,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 36 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:42:13,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-10-15 16:42:13,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-10-15 16:42:13,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 81 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:13,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2022-10-15 16:42:13,471 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 19 [2022-10-15 16:42:13,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:13,471 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2022-10-15 16:42:13,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 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) [2022-10-15 16:42:13,472 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2022-10-15 16:42:13,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 16:42:13,473 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:13,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:42:13,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 16:42:13,473 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2022-10-15 16:42:13,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:13,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1950177242, now seen corresponding path program 1 times [2022-10-15 16:42:13,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:13,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176175601] [2022-10-15 16:42:13,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:13,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:13,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:42:13,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:13,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176175601] [2022-10-15 16:42:13,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176175601] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:13,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:13,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-15 16:42:13,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572837646] [2022-10-15 16:42:13,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:13,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:42:13,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:13,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:42:13,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:42:13,637 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 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) [2022-10-15 16:42:13,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:13,692 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2022-10-15 16:42:13,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:42:13,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 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 [2022-10-15 16:42:13,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:13,694 INFO L225 Difference]: With dead ends: 80 [2022-10-15 16:42:13,694 INFO L226 Difference]: Without dead ends: 80 [2022-10-15 16:42:13,694 INFO L412 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 [2022-10-15 16:42:13,695 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 64 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:13,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 37 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:42:13,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-10-15 16:42:13,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-10-15 16:42:13,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 79 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:13,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2022-10-15 16:42:13,699 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 19 [2022-10-15 16:42:13,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:13,699 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2022-10-15 16:42:13,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 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) [2022-10-15 16:42:13,700 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2022-10-15 16:42:13,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-15 16:42:13,701 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:13,701 INFO L195 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] [2022-10-15 16:42:13,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 16:42:13,701 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2022-10-15 16:42:13,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:13,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1820134103, now seen corresponding path program 1 times [2022-10-15 16:42:13,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:13,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381648601] [2022-10-15 16:42:13,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:13,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:13,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:42:13,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:13,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381648601] [2022-10-15 16:42:13,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381648601] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:13,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:13,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-15 16:42:13,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675178913] [2022-10-15 16:42:13,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:13,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:42:13,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:13,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:42:13,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:42:13,827 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:13,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:13,884 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2022-10-15 16:42:13,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:42:13,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-15 16:42:13,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:13,885 INFO L225 Difference]: With dead ends: 77 [2022-10-15 16:42:13,886 INFO L226 Difference]: Without dead ends: 77 [2022-10-15 16:42:13,886 INFO L412 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 [2022-10-15 16:42:13,887 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:13,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 33 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:42:13,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-10-15 16:42:13,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-10-15 16:42:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 76 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2022-10-15 16:42:13,890 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 24 [2022-10-15 16:42:13,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:13,891 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2022-10-15 16:42:13,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:13,891 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2022-10-15 16:42:13,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-15 16:42:13,892 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:13,892 INFO L195 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] [2022-10-15 16:42:13,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 16:42:13,893 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2022-10-15 16:42:13,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:13,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1820134102, now seen corresponding path program 1 times [2022-10-15 16:42:13,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:13,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671425574] [2022-10-15 16:42:13,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:13,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:42:14,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:14,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671425574] [2022-10-15 16:42:14,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671425574] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:14,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:14,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-15 16:42:14,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955612948] [2022-10-15 16:42:14,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:14,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:42:14,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:14,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:42:14,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:42:14,037 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:14,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:14,092 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2022-10-15 16:42:14,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:42:14,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-15 16:42:14,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:14,093 INFO L225 Difference]: With dead ends: 74 [2022-10-15 16:42:14,094 INFO L226 Difference]: Without dead ends: 74 [2022-10-15 16:42:14,094 INFO L412 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 [2022-10-15 16:42:14,095 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:14,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 34 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:42:14,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-10-15 16:42:14,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-10-15 16:42:14,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 73 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2022-10-15 16:42:14,100 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 24 [2022-10-15 16:42:14,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:14,108 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2022-10-15 16:42:14,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:14,108 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2022-10-15 16:42:14,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-15 16:42:14,112 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:14,112 INFO L195 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, 1, 1, 1, 1] [2022-10-15 16:42:14,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 16:42:14,114 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2022-10-15 16:42:14,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:14,115 INFO L85 PathProgramCache]: Analyzing trace with hash -12560106, now seen corresponding path program 1 times [2022-10-15 16:42:14,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:14,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452535185] [2022-10-15 16:42:14,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:14,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:14,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:42:14,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:14,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452535185] [2022-10-15 16:42:14,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452535185] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:14,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:14,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-15 16:42:14,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592121515] [2022-10-15 16:42:14,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:14,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:42:14,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:14,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:42:14,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:42:14,281 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:14,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:14,335 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2022-10-15 16:42:14,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:42:14,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-10-15 16:42:14,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:14,336 INFO L225 Difference]: With dead ends: 72 [2022-10-15 16:42:14,336 INFO L226 Difference]: Without dead ends: 72 [2022-10-15 16:42:14,336 INFO L412 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 [2022-10-15 16:42:14,337 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:14,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 31 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:42:14,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-10-15 16:42:14,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-10-15 16:42:14,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 71 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:14,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2022-10-15 16:42:14,344 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 34 [2022-10-15 16:42:14,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:14,344 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2022-10-15 16:42:14,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:14,345 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2022-10-15 16:42:14,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-15 16:42:14,345 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:14,346 INFO L195 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, 1, 1, 1, 1] [2022-10-15 16:42:14,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 16:42:14,346 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2022-10-15 16:42:14,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:14,347 INFO L85 PathProgramCache]: Analyzing trace with hash -12560105, now seen corresponding path program 1 times [2022-10-15 16:42:14,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:14,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581121224] [2022-10-15 16:42:14,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:14,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:14,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:42:14,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:14,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581121224] [2022-10-15 16:42:14,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581121224] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:14,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:14,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-15 16:42:14,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192057935] [2022-10-15 16:42:14,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:14,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:42:14,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:14,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:42:14,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:42:14,577 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:14,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:14,630 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2022-10-15 16:42:14,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:42:14,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-10-15 16:42:14,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:14,632 INFO L225 Difference]: With dead ends: 70 [2022-10-15 16:42:14,632 INFO L226 Difference]: Without dead ends: 70 [2022-10-15 16:42:14,632 INFO L412 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 [2022-10-15 16:42:14,633 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:14,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 32 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:42:14,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-10-15 16:42:14,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-10-15 16:42:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.180327868852459) internal successors, (72), 69 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:14,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2022-10-15 16:42:14,637 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 34 [2022-10-15 16:42:14,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:14,637 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2022-10-15 16:42:14,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:14,637 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2022-10-15 16:42:14,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-10-15 16:42:14,638 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:14,638 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:42:14,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-15 16:42:14,639 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2022-10-15 16:42:14,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:14,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1853351821, now seen corresponding path program 1 times [2022-10-15 16:42:14,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:14,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879867988] [2022-10-15 16:42:14,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:14,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:14,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:42:14,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:14,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879867988] [2022-10-15 16:42:14,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879867988] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:14,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:14,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:42:14,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445564957] [2022-10-15 16:42:14,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:14,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:42:14,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:14,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:42:14,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:42:14,786 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:14,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:14,800 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2022-10-15 16:42:14,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:42:14,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-10-15 16:42:14,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:14,801 INFO L225 Difference]: With dead ends: 72 [2022-10-15 16:42:14,802 INFO L226 Difference]: Without dead ends: 70 [2022-10-15 16:42:14,802 INFO L412 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 [2022-10-15 16:42:14,803 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 1 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:14,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 206 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:42:14,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-10-15 16:42:14,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-10-15 16:42:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 69 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:14,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2022-10-15 16:42:14,806 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 39 [2022-10-15 16:42:14,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:14,807 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2022-10-15 16:42:14,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:14,807 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-10-15 16:42:14,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-15 16:42:14,808 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:14,808 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:42:14,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-15 16:42:14,809 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2022-10-15 16:42:14,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:14,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1716063280, now seen corresponding path program 1 times [2022-10-15 16:42:14,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:14,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448839436] [2022-10-15 16:42:14,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:14,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:14,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:42:14,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:14,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448839436] [2022-10-15 16:42:14,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448839436] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:14,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:14,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-15 16:42:14,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194553408] [2022-10-15 16:42:14,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:14,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:42:14,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:14,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:42:14,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:42:14,956 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 3 states, 2 states have (on average 20.5) internal successors, (41), 2 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) [2022-10-15 16:42:15,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:15,006 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2022-10-15 16:42:15,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:42:15,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 2 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 41 [2022-10-15 16:42:15,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:15,007 INFO L225 Difference]: With dead ends: 67 [2022-10-15 16:42:15,007 INFO L226 Difference]: Without dead ends: 67 [2022-10-15 16:42:15,008 INFO L412 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 [2022-10-15 16:42:15,008 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:15,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 27 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:42:15,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-10-15 16:42:15,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-10-15 16:42:15,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 66 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:15,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-10-15 16:42:15,011 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 41 [2022-10-15 16:42:15,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:15,012 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-10-15 16:42:15,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 2 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) [2022-10-15 16:42:15,012 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-10-15 16:42:15,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-15 16:42:15,013 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:15,013 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:42:15,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-15 16:42:15,013 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2022-10-15 16:42:15,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:15,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1716063281, now seen corresponding path program 1 times [2022-10-15 16:42:15,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:15,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298873980] [2022-10-15 16:42:15,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:15,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:15,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:42:15,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:15,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298873980] [2022-10-15 16:42:15,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298873980] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:15,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:15,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-15 16:42:15,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406933605] [2022-10-15 16:42:15,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:15,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:42:15,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:15,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:42:15,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:42:15,290 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 3 states, 2 states have (on average 20.5) internal successors, (41), 2 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) [2022-10-15 16:42:15,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:15,344 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2022-10-15 16:42:15,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:42:15,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 2 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 41 [2022-10-15 16:42:15,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:15,346 INFO L225 Difference]: With dead ends: 64 [2022-10-15 16:42:15,346 INFO L226 Difference]: Without dead ends: 64 [2022-10-15 16:42:15,346 INFO L412 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 [2022-10-15 16:42:15,347 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:15,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 28 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:42:15,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-10-15 16:42:15,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-10-15 16:42:15,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 63 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2022-10-15 16:42:15,353 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 41 [2022-10-15 16:42:15,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:15,354 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2022-10-15 16:42:15,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 2 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) [2022-10-15 16:42:15,354 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2022-10-15 16:42:15,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-10-15 16:42:15,356 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:15,356 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:42:15,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-10-15 16:42:15,357 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2022-10-15 16:42:15,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:15,358 INFO L85 PathProgramCache]: Analyzing trace with hash -267218328, now seen corresponding path program 1 times [2022-10-15 16:42:15,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:15,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485042558] [2022-10-15 16:42:15,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:15,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:42:15,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:15,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485042558] [2022-10-15 16:42:15,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485042558] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:15,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:15,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:42:15,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179677871] [2022-10-15 16:42:15,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:15,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:42:15,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:15,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:42:15,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:42:15,602 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:15,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:15,673 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2022-10-15 16:42:15,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:42:15,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-10-15 16:42:15,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:15,675 INFO L225 Difference]: With dead ends: 74 [2022-10-15 16:42:15,675 INFO L226 Difference]: Without dead ends: 74 [2022-10-15 16:42:15,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:42:15,678 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 81 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:15,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 39 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:42:15,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-10-15 16:42:15,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 63. [2022-10-15 16:42:15,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 62 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) [2022-10-15 16:42:15,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2022-10-15 16:42:15,687 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 46 [2022-10-15 16:42:15,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:15,687 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2022-10-15 16:42:15,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:15,688 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-10-15 16:42:15,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-10-15 16:42:15,688 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:15,688 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:42:15,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-10-15 16:42:15,689 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2022-10-15 16:42:15,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:15,690 INFO L85 PathProgramCache]: Analyzing trace with hash -267218327, now seen corresponding path program 1 times [2022-10-15 16:42:15,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:15,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416301418] [2022-10-15 16:42:15,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:15,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:42:16,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:16,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416301418] [2022-10-15 16:42:16,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416301418] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:16,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:16,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:42:16,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160728646] [2022-10-15 16:42:16,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:16,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:42:16,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:16,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:42:16,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:42:16,006 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:16,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:16,080 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2022-10-15 16:42:16,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:42:16,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-10-15 16:42:16,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:16,082 INFO L225 Difference]: With dead ends: 73 [2022-10-15 16:42:16,082 INFO L226 Difference]: Without dead ends: 73 [2022-10-15 16:42:16,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:42:16,084 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 74 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:16,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 41 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:42:16,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-10-15 16:42:16,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 62. [2022-10-15 16:42:16,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:16,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2022-10-15 16:42:16,089 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 46 [2022-10-15 16:42:16,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:16,090 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2022-10-15 16:42:16,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2022-10-15 16:42:16,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-15 16:42:16,091 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:16,091 INFO L195 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, 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] [2022-10-15 16:42:16,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-10-15 16:42:16,092 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2022-10-15 16:42:16,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:16,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1848538102, now seen corresponding path program 1 times [2022-10-15 16:42:16,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:16,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446680450] [2022-10-15 16:42:16,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:16,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:42:16,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:42:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:42:16,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:42:16,411 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:42:16,412 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_LEAK (73 of 74 remaining) [2022-10-15 16:42:16,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 74 remaining) [2022-10-15 16:42:16,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 74 remaining) [2022-10-15 16:42:16,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 74 remaining) [2022-10-15 16:42:16,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 74 remaining) [2022-10-15 16:42:16,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 74 remaining) [2022-10-15 16:42:16,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 74 remaining) [2022-10-15 16:42:16,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 74 remaining) [2022-10-15 16:42:16,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 74 remaining) [2022-10-15 16:42:16,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 74 remaining) [2022-10-15 16:42:16,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 74 remaining) [2022-10-15 16:42:16,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 74 remaining) [2022-10-15 16:42:16,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 74 remaining) [2022-10-15 16:42:16,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 74 remaining) [2022-10-15 16:42:16,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 74 remaining) [2022-10-15 16:42:16,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 74 remaining) [2022-10-15 16:42:16,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 74 remaining) [2022-10-15 16:42:16,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 74 remaining) [2022-10-15 16:42:16,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 74 remaining) [2022-10-15 16:42:16,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 74 remaining) [2022-10-15 16:42:16,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 74 remaining) [2022-10-15 16:42:16,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 74 remaining) [2022-10-15 16:42:16,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 74 remaining) [2022-10-15 16:42:16,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 74 remaining) [2022-10-15 16:42:16,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 74 remaining) [2022-10-15 16:42:16,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 74 remaining) [2022-10-15 16:42:16,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 74 remaining) [2022-10-15 16:42:16,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 74 remaining) [2022-10-15 16:42:16,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 74 remaining) [2022-10-15 16:42:16,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 74 remaining) [2022-10-15 16:42:16,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 74 remaining) [2022-10-15 16:42:16,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 74 remaining) [2022-10-15 16:42:16,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 74 remaining) [2022-10-15 16:42:16,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 74 remaining) [2022-10-15 16:42:16,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 74 remaining) [2022-10-15 16:42:16,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 74 remaining) [2022-10-15 16:42:16,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 74 remaining) [2022-10-15 16:42:16,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 74 remaining) [2022-10-15 16:42:16,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 74 remaining) [2022-10-15 16:42:16,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 74 remaining) [2022-10-15 16:42:16,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 74 remaining) [2022-10-15 16:42:16,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 74 remaining) [2022-10-15 16:42:16,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 74 remaining) [2022-10-15 16:42:16,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 74 remaining) [2022-10-15 16:42:16,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 74 remaining) [2022-10-15 16:42:16,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 74 remaining) [2022-10-15 16:42:16,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 74 remaining) [2022-10-15 16:42:16,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 74 remaining) [2022-10-15 16:42:16,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 74 remaining) [2022-10-15 16:42:16,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 74 remaining) [2022-10-15 16:42:16,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 74 remaining) [2022-10-15 16:42:16,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 74 remaining) [2022-10-15 16:42:16,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 74 remaining) [2022-10-15 16:42:16,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 74 remaining) [2022-10-15 16:42:16,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 74 remaining) [2022-10-15 16:42:16,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 74 remaining) [2022-10-15 16:42:16,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 74 remaining) [2022-10-15 16:42:16,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 74 remaining) [2022-10-15 16:42:16,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 74 remaining) [2022-10-15 16:42:16,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 74 remaining) [2022-10-15 16:42:16,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 74 remaining) [2022-10-15 16:42:16,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 74 remaining) [2022-10-15 16:42:16,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 74 remaining) [2022-10-15 16:42:16,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 74 remaining) [2022-10-15 16:42:16,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 74 remaining) [2022-10-15 16:42:16,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 74 remaining) [2022-10-15 16:42:16,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 74 remaining) [2022-10-15 16:42:16,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 74 remaining) [2022-10-15 16:42:16,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 74 remaining) [2022-10-15 16:42:16,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 74 remaining) [2022-10-15 16:42:16,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 74 remaining) [2022-10-15 16:42:16,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 74 remaining) [2022-10-15 16:42:16,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 74 remaining) [2022-10-15 16:42:16,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_LEAK (0 of 74 remaining) [2022-10-15 16:42:16,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-10-15 16:42:16,447 INFO L444 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] [2022-10-15 16:42:16,453 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:42:16,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:42:16 BoogieIcfgContainer [2022-10-15 16:42:16,607 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:42:16,608 INFO L158 Benchmark]: Toolchain (without parser) took 8303.71ms. Allocated memory was 158.3MB in the beginning and 237.0MB in the end (delta: 78.6MB). Free memory was 131.7MB in the beginning and 175.2MB in the end (delta: -43.5MB). Peak memory consumption was 35.9MB. Max. memory is 8.0GB. [2022-10-15 16:42:16,608 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 158.3MB. Free memory was 129.4MB in the beginning and 129.4MB in the end (delta: 62.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:42:16,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.02ms. Allocated memory is still 158.3MB. Free memory was 131.6MB in the beginning and 120.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-15 16:42:16,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.30ms. Allocated memory is still 158.3MB. Free memory was 120.5MB in the beginning and 118.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:42:16,609 INFO L158 Benchmark]: Boogie Preprocessor took 89.52ms. Allocated memory is still 158.3MB. Free memory was 118.4MB in the beginning and 116.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:42:16,610 INFO L158 Benchmark]: RCFGBuilder took 1132.21ms. Allocated memory is still 158.3MB. Free memory was 116.6MB in the beginning and 127.9MB in the end (delta: -11.2MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. [2022-10-15 16:42:16,610 INFO L158 Benchmark]: TraceAbstraction took 6532.18ms. Allocated memory was 158.3MB in the beginning and 237.0MB in the end (delta: 78.6MB). Free memory was 127.3MB in the beginning and 175.2MB in the end (delta: -47.9MB). Peak memory consumption was 30.8MB. Max. memory is 8.0GB. [2022-10-15 16:42:16,612 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 158.3MB. Free memory was 129.4MB in the beginning and 129.4MB in the end (delta: 62.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 426.02ms. Allocated memory is still 158.3MB. Free memory was 131.6MB in the beginning and 120.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 104.30ms. Allocated memory is still 158.3MB. Free memory was 120.5MB in the beginning and 118.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 89.52ms. Allocated memory is still 158.3MB. Free memory was 118.4MB in the beginning and 116.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1132.21ms. Allocated memory is still 158.3MB. Free memory was 116.6MB in the beginning and 127.9MB in the end (delta: -11.2MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. * TraceAbstraction took 6532.18ms. Allocated memory was 158.3MB in the beginning and 237.0MB in the end (delta: 78.6MB). Free memory was 127.3MB in the beginning and 175.2MB in the end (delta: -47.9MB). Peak memory consumption was 30.8MB. Max. memory is 8.0GB. * 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: 13]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 36, overapproximation of memtrack at line 13, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of to_real at line 16. Possible FailurePath: [L16] double A1[3] = { 1, 0.5179422053046, 1.0 }; [L17] double b1[2] = { 1.470767736573, 0.5522073405779 }; [L18] double A2[3] = { 1, 1.633101801841, 1.0 }; [L19] double b2[2] = { 1.742319554830, 0.820939679242 }; [L21] double D1[2], D2[2]; [L22] double P, X; VAL [A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, P={10:0}, X={11:0}] [L43] D1[0] = 0. VAL [A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, P={10:0}, X={11:0}] [L43] D1[1] = 0. VAL [A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, P={10:0}, X={11:0}] [L44] D2[0] = 0. VAL [A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, P={10:0}, X={11:0}] [L44] D2[1] = 0. VAL [A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, P={10:0}, X={11:0}] [L45] P = 0. VAL [A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, P={10:0}, X={11:0}] [L47] COND TRUE 1 VAL [A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, P={10:0}, X={11:0}] [L49] X = __VERIFIER_nondet_double() VAL [__VERIFIER_nondet_double()=77, A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, P={10:0}, X={11:0}] [L50] EXPR \read(X) VAL [\read(X)=77, A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, P={10:0}, X={11:0}] [L50] EXPR X >= -10. && X <= 10. VAL [\read(X)=77, A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, P={10:0}, X={11:0}, X >= -10. && X <= 10.=1] [L50] EXPR \read(X) VAL [\read(X)=77, \read(X)=77, A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, P={10:0}, X={11:0}, X >= -10. && X <= 10.=1] [L50] EXPR X >= -10. && X <= 10. VAL [\read(X)=77, \read(X)=77, A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, P={10:0}, X={11:0}] [L50] CALL assume_abort_if_not(X >= -10. && X <= 10.) [L11] COND FALSE !(!cond) VAL [\old(cond)=1, A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, cond=1, D1={8:0}, D2={9:0}, P={10:0}, X={11:0}] [L50] RET assume_abort_if_not(X >= -10. && X <= 10.) [L52] CALL iir4(&X, &P) [L26] double x1, y1, t1, t2; VAL [A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, P={10:0}, x={11:0}, X={11:0}, x={11:0}, y={10:0}, y={10:0}] [L28] EXPR \read(*x) VAL [\read(*x)=77, A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, P={10:0}, x={11:0}, X={11:0}, x={11:0}, y={10:0}, y={10:0}] [L28] x1 = 0.0117749388721091 * *x [L30] EXPR b1[0] VAL [A1={4:0}, A2={6:0}, b1={5:0}, b1[0]=1470767736573/1000000000000, b2={7:0}, D1={8:0}, D2={9:0}, P={10:0}, x={11:0}, x={11:0}, X={11:0}, y={10:0}, y={10:0}] [L30] EXPR D1[0] VAL [A1={4:0}, A2={6:0}, b1={5:0}, b1[0]=1470767736573/1000000000000, b2={7:0}, D1={8:0}, D1[0]=0, D2={9:0}, P={10:0}, x={11:0}, X={11:0}, x={11:0}, y={10:0}, y={10:0}] [L30] EXPR b1[1] VAL [A1={4:0}, A2={6:0}, b1={5:0}, b1[0]=1470767736573/1000000000000, b1[1]=5522073405779/10000000000000, b2={7:0}, D1={8:0}, D1[0]=0, D2={9:0}, P={10:0}, X={11:0}, x={11:0}, x={11:0}, y={10:0}, y={10:0}] [L30] EXPR D1[1] VAL [A1={4:0}, A2={6:0}, b1={5:0}, b1[0]=1470767736573/1000000000000, b1[1]=5522073405779/10000000000000, b2={7:0}, D1={8:0}, D1[0]=0, D1[1]=0, D2={9:0}, P={10:0}, x={11:0}, X={11:0}, x={11:0}, y={10:0}, y={10:0}] [L30] t1 = x1 + b1[0]*D1[0] - b1[1]*D1[1] [L31] EXPR A1[0] VAL [A1={4:0}, A1[0]=74, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, P={10:0}, x={11:0}, X={11:0}, x={11:0}, y={10:0}, y={10:0}] [L31] EXPR A1[1] VAL [A1={4:0}, A1[0]=74, A1[1]=2589711026523/5000000000000, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, P={10:0}, x={11:0}, x={11:0}, X={11:0}, y={10:0}, y={10:0}] [L31] EXPR D1[0] VAL [A1={4:0}, A1[0]=74, A1[1]=2589711026523/5000000000000, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D1[0]=0, D2={9:0}, P={10:0}, x={11:0}, X={11:0}, x={11:0}, y={10:0}, y={10:0}] [L31] EXPR A1[2] VAL [A1={4:0}, A1[0]=74, A1[1]=2589711026523/5000000000000, A1[2]=1, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D1[0]=0, D2={9:0}, P={10:0}, X={11:0}, x={11:0}, x={11:0}, y={10:0}, y={10:0}] [L31] EXPR D1[1] VAL [A1={4:0}, A1[0]=74, A1[1]=2589711026523/5000000000000, A1[2]=1, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D1[0]=0, D1[1]=0, D2={9:0}, P={10:0}, x={11:0}, X={11:0}, x={11:0}, y={10:0}, y={10:0}] [L31] y1 = A1[0]*t1 - A1[1]*D1[0] + A1[2]*D1[1] [L32] EXPR D1[0] VAL [A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D1[0]=0, D2={9:0}, P={10:0}, x={11:0}, X={11:0}, x={11:0}, y={10:0}, y={10:0}] [L32] D1[1] = D1[0] VAL [A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D1[0]=0, D2={9:0}, P={10:0}, X={11:0}, x={11:0}, x={11:0}, y={10:0}, y={10:0}] [L33] D1[0] = t1 VAL [A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, P={10:0}, t1=75, x={11:0}, X={11:0}, x={11:0}, y={10:0}, y={10:0}] [L35] EXPR b2[0] VAL [A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, b2[0]=174231955483/100000000000, D1={8:0}, D2={9:0}, P={10:0}, t1=75, X={11:0}, x={11:0}, x={11:0}, y={10:0}, y={10:0}] [L35] EXPR D2[0] VAL [A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, b2[0]=174231955483/100000000000, D1={8:0}, D2={9:0}, D2[0]=0, P={10:0}, t1=75, X={11:0}, x={11:0}, x={11:0}, y={10:0}, y={10:0}] [L35] EXPR b2[1] VAL [A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, b2[0]=174231955483/100000000000, b2[1]=410469839621/500000000000, D1={8:0}, D2={9:0}, D2[0]=0, P={10:0}, t1=75, x={11:0}, x={11:0}, X={11:0}, y={10:0}, y={10:0}] [L35] EXPR D2[1] VAL [A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, b2[0]=174231955483/100000000000, b2[1]=410469839621/500000000000, D1={8:0}, D2={9:0}, D2[0]=0, D2[1]=0, P={10:0}, t1=75, x={11:0}, X={11:0}, x={11:0}, y={10:0}, y={10:0}] [L35] t2 = y1 + b2[0]*D2[0] - b2[1]*D2[1] [L36] EXPR A2[0] VAL [A1={4:0}, A2={6:0}, A2[0]=76, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, P={10:0}, t1=75, x={11:0}, X={11:0}, x={11:0}, y={10:0}, y={10:0}] [L36] EXPR A2[1] VAL [A1={4:0}, A2={6:0}, A2[0]=76, A2[1]=1633101801841/1000000000000, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, P={10:0}, t1=75, x={11:0}, X={11:0}, x={11:0}, y={10:0}, y={10:0}] [L36] EXPR D2[0] VAL [A1={4:0}, A2={6:0}, A2[0]=76, A2[1]=1633101801841/1000000000000, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, D2[0]=0, P={10:0}, t1=75, X={11:0}, x={11:0}, x={11:0}, y={10:0}, y={10:0}] [L36] EXPR A2[2] VAL [A1={4:0}, A2={6:0}, A2[0]=76, A2[1]=1633101801841/1000000000000, A2[2]=1, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, D2[0]=0, P={10:0}, t1=75, X={11:0}, x={11:0}, x={11:0}, y={10:0}, y={10:0}] [L36] EXPR D2[1] VAL [A1={4:0}, A2={6:0}, A2[0]=76, A2[1]=1633101801841/1000000000000, A2[2]=1, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, D2[0]=0, D2[1]=0, P={10:0}, t1=75, x={11:0}, x={11:0}, X={11:0}, y={10:0}, y={10:0}] [L36] *y = A2[0]*t2 - A2[1]*D2[0] + A2[2]*D2[1] VAL [A1={4:0}, A2={6:0}, A2[0]=76, A2[1]=1633101801841/1000000000000, A2[2]=1, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, D2[0]=0, D2[1]=0, P={10:0}, t1=75, X={11:0}, x={11:0}, x={11:0}, y={10:0}, y={10:0}] [L37] EXPR D2[0] VAL [A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, D2[0]=0, P={10:0}, t1=75, X={11:0}, x={11:0}, x={11:0}, y={10:0}, y={10:0}] [L37] D2[1] = D2[0] VAL [A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, D2[0]=0, P={10:0}, t1=75, X={11:0}, x={11:0}, x={11:0}, y={10:0}, y={10:0}] [L38] D2[0] = t2 VAL [A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, P={10:0}, t1=75, t2=73, x={11:0}, x={11:0}, X={11:0}, y={10:0}, y={10:0}] [L52] RET iir4(&X, &P) [L54] EXPR \read(P) VAL [\read(P)=78, A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, P={10:0}, X={11:0}] [L54] EXPR P >= -1e30 && P <= 1e30 VAL [\read(P)=78, A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, D1={8:0}, D2={9:0}, P={10:0}, P >= -1e30 && P <= 1e30=0, X={11:0}] [L54] CALL __VERIFIER_assert(P >= -1e30 && P <= 1e30) [L13] COND TRUE !(cond) VAL [\old(cond)=0, A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, cond=0, D1={8:0}, D2={9:0}, P={10:0}, X={11:0}] [L13] reach_error() VAL [\old(cond)=0, A1={4:0}, A2={6:0}, b1={5:0}, b2={7:0}, cond=0, D1={8:0}, D2={9:0}, P={10:0}, X={11:0}] - 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: -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: 41]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 139 locations, 74 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1619 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1619 mSDsluCounter, 1012 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 167 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1043 IncrementalHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 845 mSDtfsCounter, 1043 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=0, InterpolantAutomatonStates: 68, 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, 21 MinimizatonAttempts, 44 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 507 NumberOfCodeBlocks, 507 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 428 ConstructedInterpolants, 0 QuantifiedInterpolants, 4017 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 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 [2022-10-15 16:42:16,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...