/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-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 20:27:59,814 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 20:27:59,817 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 20:27:59,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 20:27:59,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 20:27:59,881 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 20:27:59,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 20:27:59,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 20:27:59,899 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 20:27:59,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 20:27:59,908 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 20:27:59,912 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 20:27:59,913 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 20:27:59,916 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 20:27:59,918 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 20:27:59,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 20:27:59,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 20:27:59,928 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 20:27:59,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 20:27:59,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 20:27:59,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 20:27:59,947 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 20:27:59,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 20:27:59,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 20:27:59,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 20:27:59,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 20:27:59,957 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 20:27:59,960 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 20:27:59,960 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 20:27:59,961 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 20:27:59,962 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 20:27:59,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 20:27:59,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 20:27:59,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 20:27:59,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 20:27:59,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 20:27:59,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 20:27:59,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 20:27:59,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 20:27:59,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 20:27:59,972 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 20:27:59,973 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-15 20:28:00,026 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 20:28:00,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 20:28:00,028 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 20:28:00,028 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 20:28:00,030 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 20:28:00,030 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 20:28:00,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 20:28:00,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 20:28:00,034 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 20:28:00,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 20:28:00,035 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 20:28:00,035 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 20:28:00,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 20:28:00,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 20:28:00,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 20:28:00,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 20:28:00,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 20:28:00,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 20:28:00,037 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 20:28:00,037 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 20:28:00,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 20:28:00,038 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 20:28:00,038 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 20:28:00,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 20:28:00,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 20:28:00,039 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 20:28:00,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 20:28:00,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 20:28:00,039 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 20:28:00,040 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 20:28:00,040 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 20:28:00,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 20:28:00,041 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 20:28:00,041 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 20:28:00,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 20:28:00,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 20:28:00,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 20:28:00,479 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 20:28:00,479 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 20:28:00,481 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca-2.i [2022-10-15 20:28:00,569 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fe96f75b/41266b62a96e482db52c1cbd50c3fe87/FLAGb23094a04 [2022-10-15 20:28:01,437 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 20:28:01,438 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca-2.i [2022-10-15 20:28:01,459 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fe96f75b/41266b62a96e482db52c1cbd50c3fe87/FLAGb23094a04 [2022-10-15 20:28:01,673 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fe96f75b/41266b62a96e482db52c1cbd50c3fe87 [2022-10-15 20:28:01,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 20:28:01,685 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 20:28:01,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 20:28:01,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 20:28:01,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 20:28:01,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 08:28:01" (1/1) ... [2022-10-15 20:28:01,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@302d5d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:01, skipping insertion in model container [2022-10-15 20:28:01,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 08:28:01" (1/1) ... [2022-10-15 20:28:01,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 20:28:01,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 20:28:02,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 20:28:02,347 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 20:28:02,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 20:28:02,486 INFO L208 MainTranslator]: Completed translation [2022-10-15 20:28:02,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:02 WrapperNode [2022-10-15 20:28:02,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 20:28:02,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 20:28:02,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 20:28:02,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 20:28:02,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:02" (1/1) ... [2022-10-15 20:28:02,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:02" (1/1) ... [2022-10-15 20:28:02,551 INFO L138 Inliner]: procedures = 117, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 100 [2022-10-15 20:28:02,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 20:28:02,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 20:28:02,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 20:28:02,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 20:28:02,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:02" (1/1) ... [2022-10-15 20:28:02,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:02" (1/1) ... [2022-10-15 20:28:02,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:02" (1/1) ... [2022-10-15 20:28:02,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:02" (1/1) ... [2022-10-15 20:28:02,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:02" (1/1) ... [2022-10-15 20:28:02,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:02" (1/1) ... [2022-10-15 20:28:02,585 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:02" (1/1) ... [2022-10-15 20:28:02,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:02" (1/1) ... [2022-10-15 20:28:02,589 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 20:28:02,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 20:28:02,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 20:28:02,590 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 20:28:02,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:02" (1/1) ... [2022-10-15 20:28:02,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 20:28:02,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:28:02,636 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 20:28:02,663 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 20:28:02,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 20:28:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 20:28:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 20:28:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 20:28:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 20:28:02,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 20:28:02,823 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 20:28:02,826 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 20:28:03,163 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 20:28:03,171 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 20:28:03,171 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-15 20:28:03,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 08:28:03 BoogieIcfgContainer [2022-10-15 20:28:03,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 20:28:03,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 20:28:03,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 20:28:03,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 20:28:03,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 08:28:01" (1/3) ... [2022-10-15 20:28:03,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42116ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 08:28:03, skipping insertion in model container [2022-10-15 20:28:03,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:02" (2/3) ... [2022-10-15 20:28:03,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42116ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 08:28:03, skipping insertion in model container [2022-10-15 20:28:03,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 08:28:03" (3/3) ... [2022-10-15 20:28:03,185 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca-2.i [2022-10-15 20:28:03,212 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 20:28:03,213 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-10-15 20:28:03,279 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 20:28:03,288 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@744c83cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 20:28:03,289 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2022-10-15 20:28:03,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 29 states have (on average 1.793103448275862) internal successors, (52), 41 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:03,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 20:28:03,301 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:28:03,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 20:28:03,303 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-15 20:28:03,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:28:03,310 INFO L85 PathProgramCache]: Analyzing trace with hash 889510733, now seen corresponding path program 1 times [2022-10-15 20:28:03,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:28:03,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330754876] [2022-10-15 20:28:03,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:28:03,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:28:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:28:03,638 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 20:28:03,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:28:03,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330754876] [2022-10-15 20:28:03,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330754876] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:28:03,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:28:03,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 20:28:03,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342135322] [2022-10-15 20:28:03,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:28:03,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 20:28:03,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:28:03,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 20:28:03,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 20:28:03,687 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.793103448275862) internal successors, (52), 41 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:03,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:28:03,776 INFO L93 Difference]: Finished difference Result 105 states and 133 transitions. [2022-10-15 20:28:03,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 20:28:03,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-15 20:28:03,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:28:03,794 INFO L225 Difference]: With dead ends: 105 [2022-10-15 20:28:03,795 INFO L226 Difference]: Without dead ends: 61 [2022-10-15 20:28:03,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 20:28:03,811 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 39 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:28:03,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 71 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:28:03,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-10-15 20:28:03,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2022-10-15 20:28:03,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 49 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 20:28:03,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2022-10-15 20:28:03,869 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 6 [2022-10-15 20:28:03,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:28:03,870 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2022-10-15 20:28:03,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2022-10-15 20:28:03,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 20:28:03,871 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:28:03,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 20:28:03,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 20:28:03,873 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-15 20:28:03,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:28:03,885 INFO L85 PathProgramCache]: Analyzing trace with hash 889570315, now seen corresponding path program 1 times [2022-10-15 20:28:03,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:28:03,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90345462] [2022-10-15 20:28:03,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:28:03,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:28:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:28:03,958 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 20:28:03,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:28:03,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90345462] [2022-10-15 20:28:03,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90345462] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:28:03,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:28:03,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 20:28:03,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224942815] [2022-10-15 20:28:03,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:28:03,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 20:28:03,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:28:03,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 20:28:03,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 20:28:03,966 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:04,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:28:04,007 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-10-15 20:28:04,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 20:28:04,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-15 20:28:04,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:28:04,010 INFO L225 Difference]: With dead ends: 50 [2022-10-15 20:28:04,011 INFO L226 Difference]: Without dead ends: 48 [2022-10-15 20:28:04,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 20:28:04,019 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 29 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:28:04,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 25 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:28:04,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-10-15 20:28:04,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2022-10-15 20:28:04,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 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 20:28:04,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-10-15 20:28:04,037 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 6 [2022-10-15 20:28:04,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:28:04,039 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-10-15 20:28:04,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:04,040 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-10-15 20:28:04,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 20:28:04,042 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:28:04,042 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:28:04,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 20:28:04,043 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-15 20:28:04,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:28:04,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028999, now seen corresponding path program 1 times [2022-10-15 20:28:04,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:28:04,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966819747] [2022-10-15 20:28:04,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:28:04,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:28:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:28:04,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 20:28:04,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:28:04,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966819747] [2022-10-15 20:28:04,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966819747] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:28:04,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:28:04,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 20:28:04,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485390368] [2022-10-15 20:28:04,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:28:04,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 20:28:04,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:28:04,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 20:28:04,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 20:28:04,159 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 20:28:04,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:28:04,177 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-10-15 20:28:04,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 20:28:04,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 20:28:04,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:28:04,179 INFO L225 Difference]: With dead ends: 32 [2022-10-15 20:28:04,179 INFO L226 Difference]: Without dead ends: 30 [2022-10-15 20:28:04,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 20:28:04,181 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:28:04,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 27 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:28:04,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-10-15 20:28:04,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-10-15 20:28:04,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.5) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:04,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-10-15 20:28:04,187 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 7 [2022-10-15 20:28:04,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:28:04,188 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-10-15 20:28:04,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 20:28:04,188 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-10-15 20:28:04,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 20:28:04,189 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:28:04,189 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:28:04,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 20:28:04,190 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-15 20:28:04,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:28:04,191 INFO L85 PathProgramCache]: Analyzing trace with hash 628418293, now seen corresponding path program 1 times [2022-10-15 20:28:04,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:28:04,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077319389] [2022-10-15 20:28:04,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:28:04,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:28:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:28:04,294 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 20:28:04,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:28:04,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077319389] [2022-10-15 20:28:04,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077319389] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:28:04,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:28:04,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 20:28:04,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766903183] [2022-10-15 20:28:04,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:28:04,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 20:28:04,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:28:04,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 20:28:04,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 20:28:04,298 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:04,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:28:04,335 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-10-15 20:28:04,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 20:28:04,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-15 20:28:04,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:28:04,337 INFO L225 Difference]: With dead ends: 54 [2022-10-15 20:28:04,337 INFO L226 Difference]: Without dead ends: 52 [2022-10-15 20:28:04,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 20:28:04,339 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:28:04,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 45 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:28:04,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-10-15 20:28:04,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2022-10-15 20:28:04,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2022-10-15 20:28:04,352 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 10 [2022-10-15 20:28:04,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:28:04,352 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2022-10-15 20:28:04,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:04,353 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-10-15 20:28:04,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 20:28:04,354 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:28:04,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:28:04,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 20:28:04,354 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-15 20:28:04,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:28:04,357 INFO L85 PathProgramCache]: Analyzing trace with hash 628419956, now seen corresponding path program 1 times [2022-10-15 20:28:04,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:28:04,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709363967] [2022-10-15 20:28:04,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:28:04,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:28:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:28:04,489 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 20:28:04,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:28:04,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709363967] [2022-10-15 20:28:04,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709363967] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:28:04,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:28:04,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 20:28:04,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363953853] [2022-10-15 20:28:04,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:28:04,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 20:28:04,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:28:04,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 20:28:04,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 20:28:04,493 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:04,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:28:04,529 INFO L93 Difference]: Finished difference Result 124 states and 149 transitions. [2022-10-15 20:28:04,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 20:28:04,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-15 20:28:04,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:28:04,531 INFO L225 Difference]: With dead ends: 124 [2022-10-15 20:28:04,531 INFO L226 Difference]: Without dead ends: 83 [2022-10-15 20:28:04,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 20:28:04,533 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 40 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:28:04,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 52 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:28:04,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-10-15 20:28:04,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2022-10-15 20:28:04,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 55 states have internal predecessors, (67), 0 states have call successors, (0), 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 20:28:04,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-10-15 20:28:04,551 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 10 [2022-10-15 20:28:04,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:28:04,552 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-10-15 20:28:04,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:04,552 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-10-15 20:28:04,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 20:28:04,553 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:28:04,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:28:04,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 20:28:04,556 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-15 20:28:04,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:28:04,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1891541641, now seen corresponding path program 1 times [2022-10-15 20:28:04,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:28:04,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49798338] [2022-10-15 20:28:04,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:28:04,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:28:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:28:04,613 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 20:28:04,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:28:04,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49798338] [2022-10-15 20:28:04,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49798338] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:28:04,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:28:04,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 20:28:04,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640808281] [2022-10-15 20:28:04,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:28:04,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 20:28:04,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:28:04,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 20:28:04,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 20:28:04,617 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:04,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:28:04,649 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-10-15 20:28:04,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 20:28:04,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-15 20:28:04,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:28:04,651 INFO L225 Difference]: With dead ends: 56 [2022-10-15 20:28:04,651 INFO L226 Difference]: Without dead ends: 54 [2022-10-15 20:28:04,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 20:28:04,653 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:28:04,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 22 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:28:04,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-10-15 20:28:04,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 33. [2022-10-15 20:28:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 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 20:28:04,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-10-15 20:28:04,661 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 10 [2022-10-15 20:28:04,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:28:04,661 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-10-15 20:28:04,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:04,662 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-10-15 20:28:04,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 20:28:04,662 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:28:04,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:28:04,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 20:28:04,663 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-15 20:28:04,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:28:04,664 INFO L85 PathProgramCache]: Analyzing trace with hash -180926670, now seen corresponding path program 1 times [2022-10-15 20:28:04,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:28:04,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32125985] [2022-10-15 20:28:04,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:28:04,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:28:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:28:04,775 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 20:28:04,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:28:04,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32125985] [2022-10-15 20:28:04,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32125985] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:28:04,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:28:04,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 20:28:04,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461644388] [2022-10-15 20:28:04,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:28:04,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 20:28:04,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:28:04,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 20:28:04,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 20:28:04,778 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:04,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:28:04,822 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-10-15 20:28:04,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 20:28:04,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-15 20:28:04,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:28:04,824 INFO L225 Difference]: With dead ends: 56 [2022-10-15 20:28:04,824 INFO L226 Difference]: Without dead ends: 54 [2022-10-15 20:28:04,824 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 20:28:04,826 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:28:04,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 74 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:28:04,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-10-15 20:28:04,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2022-10-15 20:28:04,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 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 20:28:04,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-10-15 20:28:04,845 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 10 [2022-10-15 20:28:04,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:28:04,846 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-10-15 20:28:04,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:04,846 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-10-15 20:28:04,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 20:28:04,847 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:28:04,847 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:28:04,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 20:28:04,848 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-15 20:28:04,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:28:04,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1993869323, now seen corresponding path program 1 times [2022-10-15 20:28:04,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:28:04,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445360854] [2022-10-15 20:28:04,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:28:04,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:28:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:28:04,934 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 20:28:04,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:28:04,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445360854] [2022-10-15 20:28:04,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445360854] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:28:04,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:28:04,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 20:28:04,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660388484] [2022-10-15 20:28:04,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:28:04,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 20:28:04,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:28:04,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 20:28:04,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 20:28:04,938 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 20:28:04,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:28:04,963 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-10-15 20:28:04,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 20:28:04,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-10-15 20:28:04,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:28:04,965 INFO L225 Difference]: With dead ends: 39 [2022-10-15 20:28:04,965 INFO L226 Difference]: Without dead ends: 33 [2022-10-15 20:28:04,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 20:28:04,975 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:28:04,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 26 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:28:04,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-10-15 20:28:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-10-15 20:28:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:04,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-10-15 20:28:04,991 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2022-10-15 20:28:04,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:28:04,991 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-10-15 20:28:04,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 20:28:04,992 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-10-15 20:28:04,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 20:28:04,992 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:28:04,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:28:04,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 20:28:04,994 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-15 20:28:04,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:28:04,998 INFO L85 PathProgramCache]: Analyzing trace with hash 36780700, now seen corresponding path program 1 times [2022-10-15 20:28:04,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:28:04,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012310980] [2022-10-15 20:28:04,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:28:04,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:28:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:28:05,127 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 20:28:05,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:28:05,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012310980] [2022-10-15 20:28:05,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012310980] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:28:05,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:28:05,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 20:28:05,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714497099] [2022-10-15 20:28:05,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:28:05,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 20:28:05,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:28:05,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 20:28:05,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 20:28:05,130 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:05,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:28:05,152 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-10-15 20:28:05,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 20:28:05,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-15 20:28:05,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:28:05,153 INFO L225 Difference]: With dead ends: 64 [2022-10-15 20:28:05,153 INFO L226 Difference]: Without dead ends: 48 [2022-10-15 20:28:05,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 20:28:05,155 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:28:05,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 49 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:28:05,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-10-15 20:28:05,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-10-15 20:28:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 45 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:05,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-10-15 20:28:05,165 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 14 [2022-10-15 20:28:05,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:28:05,165 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-10-15 20:28:05,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:05,166 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-10-15 20:28:05,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 20:28:05,167 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:28:05,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:28:05,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 20:28:05,167 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-15 20:28:05,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:28:05,168 INFO L85 PathProgramCache]: Analyzing trace with hash 737845278, now seen corresponding path program 1 times [2022-10-15 20:28:05,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:28:05,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124905586] [2022-10-15 20:28:05,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:28:05,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:28:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:28:05,222 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 20:28:05,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:28:05,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124905586] [2022-10-15 20:28:05,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124905586] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:28:05,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:28:05,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 20:28:05,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066195101] [2022-10-15 20:28:05,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:28:05,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 20:28:05,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:28:05,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 20:28:05,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 20:28:05,226 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:05,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:28:05,256 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-10-15 20:28:05,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 20:28:05,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-15 20:28:05,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:28:05,258 INFO L225 Difference]: With dead ends: 54 [2022-10-15 20:28:05,258 INFO L226 Difference]: Without dead ends: 52 [2022-10-15 20:28:05,259 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 20:28:05,260 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:28:05,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 59 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:28:05,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-10-15 20:28:05,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-10-15 20:28:05,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 51 states have internal predecessors, (58), 0 states have call successors, (0), 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 20:28:05,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2022-10-15 20:28:05,269 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 14 [2022-10-15 20:28:05,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:28:05,269 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2022-10-15 20:28:05,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:05,270 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-10-15 20:28:05,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 20:28:05,271 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:28:05,271 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:28:05,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 20:28:05,272 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-15 20:28:05,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:28:05,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1917321044, now seen corresponding path program 1 times [2022-10-15 20:28:05,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:28:05,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21877588] [2022-10-15 20:28:05,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:28:05,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:28:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:28:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:28:05,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:28:05,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21877588] [2022-10-15 20:28:05,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21877588] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:28:05,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936491128] [2022-10-15 20:28:05,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:28:05,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:28:05,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:28:05,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 20:28:05,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 20:28:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:28:05,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 20:28:05,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:28:05,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:28:05,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 20:28:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:28:05,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936491128] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 20:28:05,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 20:28:05,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-15 20:28:05,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396981777] [2022-10-15 20:28:05,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 20:28:05,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-15 20:28:05,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:28:05,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-15 20:28:05,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-15 20:28:05,597 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 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 20:28:05,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:28:05,727 INFO L93 Difference]: Finished difference Result 152 states and 169 transitions. [2022-10-15 20:28:05,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-15 20:28:05,727 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-10-15 20:28:05,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:28:05,728 INFO L225 Difference]: With dead ends: 152 [2022-10-15 20:28:05,729 INFO L226 Difference]: Without dead ends: 151 [2022-10-15 20:28:05,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-10-15 20:28:05,730 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 84 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 20:28:05,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 116 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 20:28:05,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-10-15 20:28:05,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 86. [2022-10-15 20:28:05,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 82 states have (on average 1.2073170731707317) internal successors, (99), 85 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:05,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2022-10-15 20:28:05,743 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 16 [2022-10-15 20:28:05,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:28:05,744 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2022-10-15 20:28:05,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 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 20:28:05,744 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2022-10-15 20:28:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 20:28:05,745 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:28:05,745 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:28:05,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 20:28:05,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-10-15 20:28:05,960 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-15 20:28:05,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:28:05,961 INFO L85 PathProgramCache]: Analyzing trace with hash 692589843, now seen corresponding path program 1 times [2022-10-15 20:28:05,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:28:05,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64621675] [2022-10-15 20:28:05,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:28:05,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:28:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:28:06,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:28:06,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:28:06,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64621675] [2022-10-15 20:28:06,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64621675] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:28:06,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756406750] [2022-10-15 20:28:06,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:28:06,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:28:06,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:28:06,041 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 20:28:06,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 20:28:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:28:06,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 20:28:06,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:28:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:28:06,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 20:28:06,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756406750] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:28:06,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 20:28:06,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-15 20:28:06,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615799902] [2022-10-15 20:28:06,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:28:06,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 20:28:06,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:28:06,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 20:28:06,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-15 20:28:06,161 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:06,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:28:06,208 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2022-10-15 20:28:06,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 20:28:06,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-15 20:28:06,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:28:06,211 INFO L225 Difference]: With dead ends: 101 [2022-10-15 20:28:06,211 INFO L226 Difference]: Without dead ends: 100 [2022-10-15 20:28:06,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-15 20:28:06,213 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:28:06,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 101 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:28:06,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-10-15 20:28:06,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2022-10-15 20:28:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 84 states have internal predecessors, (93), 0 states have call successors, (0), 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 20:28:06,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2022-10-15 20:28:06,236 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 17 [2022-10-15 20:28:06,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:28:06,237 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2022-10-15 20:28:06,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:06,237 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-10-15 20:28:06,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 20:28:06,238 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:28:06,238 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:28:06,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 20:28:06,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-10-15 20:28:06,454 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-15 20:28:06,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:28:06,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1973612760, now seen corresponding path program 1 times [2022-10-15 20:28:06,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:28:06,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988239159] [2022-10-15 20:28:06,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:28:06,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:28:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:28:06,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:28:06,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:28:06,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988239159] [2022-10-15 20:28:06,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988239159] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:28:06,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43575365] [2022-10-15 20:28:06,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:28:06,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:28:06,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:28:06,537 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 20:28:06,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-15 20:28:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:28:06,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 20:28:06,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:28:06,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:28:06,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 20:28:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:28:06,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43575365] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 20:28:06,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 20:28:06,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-15 20:28:06,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412824960] [2022-10-15 20:28:06,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 20:28:06,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-15 20:28:06,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:28:06,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-15 20:28:06,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-15 20:28:06,696 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 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 20:28:06,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:28:06,815 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2022-10-15 20:28:06,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-15 20:28:06,816 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 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 20 [2022-10-15 20:28:06,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:28:06,817 INFO L225 Difference]: With dead ends: 107 [2022-10-15 20:28:06,817 INFO L226 Difference]: Without dead ends: 106 [2022-10-15 20:28:06,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-10-15 20:28:06,818 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 24 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:28:06,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 92 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:28:06,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-10-15 20:28:06,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2022-10-15 20:28:06,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 99 states have (on average 1.1313131313131313) internal successors, (112), 101 states have internal predecessors, (112), 0 states have call successors, (0), 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 20:28:06,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2022-10-15 20:28:06,839 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 20 [2022-10-15 20:28:06,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:28:06,839 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2022-10-15 20:28:06,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 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 20:28:06,840 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2022-10-15 20:28:06,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-15 20:28:06,847 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:28:06,847 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:28:06,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-15 20:28:07,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:28:07,063 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-15 20:28:07,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:28:07,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1052453501, now seen corresponding path program 1 times [2022-10-15 20:28:07,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:28:07,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640978037] [2022-10-15 20:28:07,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:28:07,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:28:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:28:07,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:28:07,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:28:07,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640978037] [2022-10-15 20:28:07,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640978037] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:28:07,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575803964] [2022-10-15 20:28:07,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:28:07,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:28:07,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:28:07,138 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 20:28:07,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-15 20:28:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:28:07,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 20:28:07,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:28:07,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:28:07,254 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 20:28:07,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575803964] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:28:07,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 20:28:07,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-15 20:28:07,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722411043] [2022-10-15 20:28:07,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:28:07,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 20:28:07,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:28:07,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 20:28:07,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-15 20:28:07,256 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:07,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:28:07,291 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-10-15 20:28:07,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 20:28:07,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-10-15 20:28:07,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:28:07,293 INFO L225 Difference]: With dead ends: 102 [2022-10-15 20:28:07,293 INFO L226 Difference]: Without dead ends: 101 [2022-10-15 20:28:07,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-15 20:28:07,294 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:28:07,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 55 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:28:07,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-10-15 20:28:07,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-10-15 20:28:07,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 99 states have (on average 1.101010101010101) internal successors, (109), 100 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 20:28:07,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2022-10-15 20:28:07,305 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 21 [2022-10-15 20:28:07,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:28:07,305 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2022-10-15 20:28:07,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:28:07,306 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2022-10-15 20:28:07,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-15 20:28:07,307 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:28:07,307 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2022-10-15 20:28:07,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-15 20:28:07,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:28:07,522 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-15 20:28:07,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:28:07,523 INFO L85 PathProgramCache]: Analyzing trace with hash 733845530, now seen corresponding path program 2 times [2022-10-15 20:28:07,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:28:07,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738061035] [2022-10-15 20:28:07,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:28:07,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:28:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:28:07,703 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:28:07,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:28:07,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738061035] [2022-10-15 20:28:07,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738061035] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:28:07,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473621467] [2022-10-15 20:28:07,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 20:28:07,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:28:07,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:28:07,706 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 20:28:07,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-15 20:28:07,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-15 20:28:07,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 20:28:07,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 20:28:07,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:28:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-10-15 20:28:07,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 20:28:07,940 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-10-15 20:28:07,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473621467] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 20:28:07,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 20:28:07,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 17 [2022-10-15 20:28:07,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131165237] [2022-10-15 20:28:07,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 20:28:07,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-15 20:28:07,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:28:07,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-15 20:28:07,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-10-15 20:28:07,943 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 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 20:28:08,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:28:08,210 INFO L93 Difference]: Finished difference Result 307 states and 319 transitions. [2022-10-15 20:28:08,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-15 20:28:08,211 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 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 20:28:08,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:28:08,212 INFO L225 Difference]: With dead ends: 307 [2022-10-15 20:28:08,213 INFO L226 Difference]: Without dead ends: 266 [2022-10-15 20:28:08,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=273, Invalid=657, Unknown=0, NotChecked=0, Total=930 [2022-10-15 20:28:08,214 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 372 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 20:28:08,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 86 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 20:28:08,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-10-15 20:28:08,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 47. [2022-10-15 20:28:08,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 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 20:28:08,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-10-15 20:28:08,224 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 34 [2022-10-15 20:28:08,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:28:08,225 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-10-15 20:28:08,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 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 20:28:08,225 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-10-15 20:28:08,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-15 20:28:08,226 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:28:08,226 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:28:08,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-15 20:28:08,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-15 20:28:08,443 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-15 20:28:08,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:28:08,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1777905158, now seen corresponding path program 2 times [2022-10-15 20:28:08,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:28:08,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866535514] [2022-10-15 20:28:08,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:28:08,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:28:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:28:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:28:08,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:28:08,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866535514] [2022-10-15 20:28:08,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866535514] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:28:08,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719546862] [2022-10-15 20:28:08,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 20:28:08,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:28:08,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:28:08,703 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 20:28:08,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-15 20:28:08,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-15 20:28:08,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 20:28:08,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 20:28:08,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:28:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-10-15 20:28:08,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 20:28:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-10-15 20:28:08,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719546862] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 20:28:08,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 20:28:08,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 17 [2022-10-15 20:28:08,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918825488] [2022-10-15 20:28:08,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 20:28:08,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-15 20:28:08,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:28:08,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-15 20:28:08,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-10-15 20:28:08,925 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 18 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 20:28:09,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:28:09,127 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2022-10-15 20:28:09,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-15 20:28:09,128 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-10-15 20:28:09,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:28:09,128 INFO L225 Difference]: With dead ends: 57 [2022-10-15 20:28:09,128 INFO L226 Difference]: Without dead ends: 0 [2022-10-15 20:28:09,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=273, Invalid=657, Unknown=0, NotChecked=0, Total=930 [2022-10-15 20:28:09,130 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 57 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 20:28:09,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 66 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 20:28:09,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-15 20:28:09,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-15 20:28:09,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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 20:28:09,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-15 20:28:09,132 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2022-10-15 20:28:09,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:28:09,132 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-15 20:28:09,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 18 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 20:28:09,133 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-15 20:28:09,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-15 20:28:09,136 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2022-10-15 20:28:09,137 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2022-10-15 20:28:09,137 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2022-10-15 20:28:09,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2022-10-15 20:28:09,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2022-10-15 20:28:09,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2022-10-15 20:28:09,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2022-10-15 20:28:09,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2022-10-15 20:28:09,139 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2022-10-15 20:28:09,139 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2022-10-15 20:28:09,139 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2022-10-15 20:28:09,139 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2022-10-15 20:28:09,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-15 20:28:09,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-15 20:28:09,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-15 20:28:15,325 WARN L233 SmtUtils]: Spent 5.87s on a formula simplification. DAG size of input: 118 DAG size of output: 115 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-10-15 20:28:15,704 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 539) no Hoare annotation was computed. [2022-10-15 20:28:15,704 INFO L899 garLoopResultBuilder]: For program point L539-1(line 539) no Hoare annotation was computed. [2022-10-15 20:28:15,704 INFO L899 garLoopResultBuilder]: For program point L539-2(lines 539 542) no Hoare annotation was computed. [2022-10-15 20:28:15,704 INFO L899 garLoopResultBuilder]: For program point L539-4(lines 539 542) no Hoare annotation was computed. [2022-10-15 20:28:15,704 INFO L899 garLoopResultBuilder]: For program point L539-5(line 539) no Hoare annotation was computed. [2022-10-15 20:28:15,705 INFO L899 garLoopResultBuilder]: For program point L539-6(line 539) no Hoare annotation was computed. [2022-10-15 20:28:15,705 INFO L895 garLoopResultBuilder]: At program point L539-7(lines 539 542) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_main_~length1~0#1|)) (.cse1 (<= 1 |ULTIMATE.start_main_~length2~0#1|)) (.cse2 (<= |ULTIMATE.start_main_~length1~0#1| 2147483647)) (.cse3 (<= |ULTIMATE.start_main_~length2~0#1| 2147483647))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse2 .cse3) (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~i~0#1| 2147483647) .cse0 .cse1 .cse2 .cse3))) [2022-10-15 20:28:15,705 INFO L899 garLoopResultBuilder]: For program point L539-8(lines 539 542) no Hoare annotation was computed. [2022-10-15 20:28:15,706 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 550) no Hoare annotation was computed. [2022-10-15 20:28:15,706 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 544) no Hoare annotation was computed. [2022-10-15 20:28:15,708 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-15 20:28:15,709 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 539) no Hoare annotation was computed. [2022-10-15 20:28:15,709 INFO L899 garLoopResultBuilder]: For program point L544-1(line 544) no Hoare annotation was computed. [2022-10-15 20:28:15,709 INFO L899 garLoopResultBuilder]: For program point L544-2(lines 544 547) no Hoare annotation was computed. [2022-10-15 20:28:15,709 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-15 20:28:15,709 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 544) no Hoare annotation was computed. [2022-10-15 20:28:15,709 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-15 20:28:15,709 INFO L899 garLoopResultBuilder]: For program point L544-4(lines 544 547) no Hoare annotation was computed. [2022-10-15 20:28:15,710 INFO L899 garLoopResultBuilder]: For program point L544-5(line 544) no Hoare annotation was computed. [2022-10-15 20:28:15,710 INFO L899 garLoopResultBuilder]: For program point L544-6(line 544) no Hoare annotation was computed. [2022-10-15 20:28:15,710 INFO L895 garLoopResultBuilder]: At program point L544-7(lines 544 547) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~i~1#1| 0)) (.cse5 (< |ULTIMATE.start_main_~i~0#1| 2147483647)) (.cse1 (<= 1 |ULTIMATE.start_main_~length1~0#1|)) (.cse2 (<= 1 |ULTIMATE.start_main_~length2~0#1|)) (.cse6 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~length1~0#1| 2147483647)) (.cse4 (<= |ULTIMATE.start_main_~length2~0#1| 2147483647))) (or (and .cse0 (<= |ULTIMATE.start_main_~length2~0#1| 1) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse5 (< |ULTIMATE.start_main_~i~1#1| 2147483647) .cse1 .cse2 .cse6 .cse3 (<= 1 |ULTIMATE.start_main_~i~1#1|) .cse4))) [2022-10-15 20:28:15,710 INFO L899 garLoopResultBuilder]: For program point L544-8(lines 544 547) no Hoare annotation was computed. [2022-10-15 20:28:15,710 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 549) no Hoare annotation was computed. [2022-10-15 20:28:15,710 INFO L899 garLoopResultBuilder]: For program point L549(line 549) no Hoare annotation was computed. [2022-10-15 20:28:15,711 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 539) no Hoare annotation was computed. [2022-10-15 20:28:15,711 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-15 20:28:15,711 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 544) no Hoare annotation was computed. [2022-10-15 20:28:15,711 INFO L899 garLoopResultBuilder]: For program point L533-1(lines 533 535) no Hoare annotation was computed. [2022-10-15 20:28:15,711 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 549) no Hoare annotation was computed. [2022-10-15 20:28:15,711 INFO L899 garLoopResultBuilder]: For program point L521-1(lines 521 524) no Hoare annotation was computed. [2022-10-15 20:28:15,711 INFO L899 garLoopResultBuilder]: For program point L550(line 550) no Hoare annotation was computed. [2022-10-15 20:28:15,712 INFO L902 garLoopResultBuilder]: At program point L521-3(lines 521 524) the Hoare annotation is: true [2022-10-15 20:28:15,714 INFO L899 garLoopResultBuilder]: For program point L550-1(line 550) no Hoare annotation was computed. [2022-10-15 20:28:15,714 INFO L902 garLoopResultBuilder]: At program point L513(lines 513 526) the Hoare annotation is: true [2022-10-15 20:28:15,714 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 539) no Hoare annotation was computed. [2022-10-15 20:28:15,714 INFO L899 garLoopResultBuilder]: For program point L530(lines 530 532) no Hoare annotation was computed. [2022-10-15 20:28:15,714 INFO L899 garLoopResultBuilder]: For program point L530-2(lines 527 552) no Hoare annotation was computed. [2022-10-15 20:28:15,715 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 550) no Hoare annotation was computed. [2022-10-15 20:28:15,715 INFO L899 garLoopResultBuilder]: For program point L522(lines 522 523) no Hoare annotation was computed. [2022-10-15 20:28:15,715 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 544) no Hoare annotation was computed. [2022-10-15 20:28:15,715 INFO L902 garLoopResultBuilder]: At program point L551(lines 527 552) the Hoare annotation is: true [2022-10-15 20:28:15,715 INFO L902 garLoopResultBuilder]: At program point L518-2(lines 518 525) the Hoare annotation is: true [2022-10-15 20:28:15,719 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:28:15,724 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 20:28:15,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 08:28:15 BoogieIcfgContainer [2022-10-15 20:28:15,759 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 20:28:15,761 INFO L158 Benchmark]: Toolchain (without parser) took 14079.11ms. Allocated memory was 151.0MB in the beginning and 327.2MB in the end (delta: 176.2MB). Free memory was 122.6MB in the beginning and 137.8MB in the end (delta: -15.2MB). Peak memory consumption was 193.5MB. Max. memory is 8.0GB. [2022-10-15 20:28:15,761 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 20:28:15,761 INFO L158 Benchmark]: CACSL2BoogieTranslator took 800.51ms. Allocated memory is still 151.0MB. Free memory was 122.4MB in the beginning and 129.9MB in the end (delta: -7.5MB). Peak memory consumption was 20.5MB. Max. memory is 8.0GB. [2022-10-15 20:28:15,762 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.24ms. Allocated memory is still 151.0MB. Free memory was 129.9MB in the beginning and 127.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 20:28:15,762 INFO L158 Benchmark]: Boogie Preprocessor took 36.39ms. Allocated memory is still 151.0MB. Free memory was 127.8MB in the beginning and 126.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 20:28:15,765 INFO L158 Benchmark]: RCFGBuilder took 583.58ms. Allocated memory is still 151.0MB. Free memory was 126.3MB in the beginning and 113.1MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-10-15 20:28:15,766 INFO L158 Benchmark]: TraceAbstraction took 12582.44ms. Allocated memory was 151.0MB in the beginning and 327.2MB in the end (delta: 176.2MB). Free memory was 112.3MB in the beginning and 137.8MB in the end (delta: -25.5MB). Peak memory consumption was 181.4MB. Max. memory is 8.0GB. [2022-10-15 20:28:15,772 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.16ms. Allocated memory is still 125.8MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 800.51ms. Allocated memory is still 151.0MB. Free memory was 122.4MB in the beginning and 129.9MB in the end (delta: -7.5MB). Peak memory consumption was 20.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.24ms. Allocated memory is still 151.0MB. Free memory was 129.9MB in the beginning and 127.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.39ms. Allocated memory is still 151.0MB. Free memory was 127.8MB in the beginning and 126.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 583.58ms. Allocated memory is still 151.0MB. Free memory was 126.3MB in the beginning and 113.1MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 12582.44ms. Allocated memory was 151.0MB in the beginning and 327.2MB in the end (delta: 176.2MB). Free memory was 112.3MB in the beginning and 137.8MB in the end (delta: -25.5MB). Peak memory consumption was 181.4MB. 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 - PositiveResult [Line: 539]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 539]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 539]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 539]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 544]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 544]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 544]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 544]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 549]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 549]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 550]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 550]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 12.5s, OverallIterations: 16, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 795 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 795 mSDsluCounter, 966 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 602 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 436 IncrementalHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 364 mSDtfsCounter, 436 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=13, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 400 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 32 NumberOfFragments, 107 HoareAnnotationTreeSize, 6 FomulaSimplifications, 37674 FormulaSimplificationTreeSizeReduction, 6.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 57022 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 390 NumberOfCodeBlocks, 342 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 472 ConstructedInterpolants, 0 QuantifiedInterpolants, 1222 SizeOfPredicates, 14 NumberOfNonLiveVariables, 455 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 26 InterpolantComputations, 12 PerfectInterpolantSequences, 204/390 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 - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 539]: Loop Invariant Derived loop invariant: ((((i == 0 && 1 <= length1) && 1 <= length2) && length1 <= 2147483647) && length2 <= 2147483647) || (((((1 <= i && i < 2147483647) && 1 <= length1) && 1 <= length2) && length1 <= 2147483647) && length2 <= 2147483647) - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 521]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 518]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 544]: Loop Invariant Derived loop invariant: ((((((i == 0 && length2 <= 1) && 1 <= length1) && 1 <= length2) && length1 <= 2147483647) && length2 <= 2147483647) || ((((((i == 0 && i < 2147483647) && 1 <= length1) && 1 <= length2) && 0 <= i) && length1 <= 2147483647) && length2 <= 2147483647)) || (((((((i < 2147483647 && i < 2147483647) && 1 <= length1) && 1 <= length2) && 0 <= i) && length1 <= 2147483647) && 1 <= i) && length2 <= 2147483647) RESULT: Ultimate proved your program to be correct! [2022-10-15 20:28:15,842 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...