/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/vogal-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-19 22:09:09,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-19 22:09:09,085 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-19 22:09:09,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-19 22:09:09,104 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-19 22:09:09,105 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-19 22:09:09,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-19 22:09:09,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-19 22:09:09,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-19 22:09:09,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-19 22:09:09,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-19 22:09:09,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-19 22:09:09,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-19 22:09:09,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-19 22:09:09,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-19 22:09:09,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-19 22:09:09,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-19 22:09:09,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-19 22:09:09,120 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-19 22:09:09,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-19 22:09:09,122 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-19 22:09:09,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-19 22:09:09,127 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-19 22:09:09,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-19 22:09:09,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-19 22:09:09,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-19 22:09:09,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-19 22:09:09,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-19 22:09:09,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-19 22:09:09,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-19 22:09:09,131 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-19 22:09:09,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-19 22:09:09,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-19 22:09:09,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-19 22:09:09,132 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-19 22:09:09,133 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-19 22:09:09,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-19 22:09:09,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-19 22:09:09,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-19 22:09:09,134 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-19 22:09:09,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-19 22:09:09,139 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-19 22:09:09,140 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-03-19 22:09:09,163 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-19 22:09:09,164 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-19 22:09:09,164 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-19 22:09:09,164 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-19 22:09:09,165 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-19 22:09:09,165 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-19 22:09:09,166 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-19 22:09:09,166 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-19 22:09:09,166 INFO L138 SettingsManager]: * Use SBE=true [2022-03-19 22:09:09,166 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-19 22:09:09,166 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-19 22:09:09,167 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-19 22:09:09,167 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-19 22:09:09,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-19 22:09:09,167 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-19 22:09:09,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-19 22:09:09,167 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-19 22:09:09,168 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-19 22:09:09,168 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-19 22:09:09,168 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-19 22:09:09,168 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-19 22:09:09,168 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-19 22:09:09,168 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-19 22:09:09,168 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-19 22:09:09,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 22:09:09,168 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-19 22:09:09,169 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-19 22:09:09,169 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-19 22:09:09,169 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-19 22:09:09,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-19 22:09:09,169 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-19 22:09:09,169 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-03-19 22:09:09,169 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-19 22:09:09,169 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-19 22:09:09,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-19 22:09:09,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-19 22:09:09,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-19 22:09:09,385 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-19 22:09:09,385 INFO L275 PluginConnector]: CDTParser initialized [2022-03-19 22:09:09,386 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/vogal-2.i [2022-03-19 22:09:09,441 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f66af391/0968ed0586aa4066ad3970a68ed8c037/FLAG1840b14c1 [2022-03-19 22:09:09,765 INFO L306 CDTParser]: Found 1 translation units. [2022-03-19 22:09:09,765 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal-2.i [2022-03-19 22:09:09,769 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f66af391/0968ed0586aa4066ad3970a68ed8c037/FLAG1840b14c1 [2022-03-19 22:09:10,203 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f66af391/0968ed0586aa4066ad3970a68ed8c037 [2022-03-19 22:09:10,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-19 22:09:10,206 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-19 22:09:10,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-19 22:09:10,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-19 22:09:10,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-19 22:09:10,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 10:09:10" (1/1) ... [2022-03-19 22:09:10,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52c7220a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:09:10, skipping insertion in model container [2022-03-19 22:09:10,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 10:09:10" (1/1) ... [2022-03-19 22:09:10,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-19 22:09:10,224 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-19 22:09:10,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal-2.i[808,821] [2022-03-19 22:09:10,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 22:09:10,439 INFO L203 MainTranslator]: Completed pre-run [2022-03-19 22:09:10,449 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal-2.i[808,821] [2022-03-19 22:09:10,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 22:09:10,480 INFO L208 MainTranslator]: Completed translation [2022-03-19 22:09:10,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:09:10 WrapperNode [2022-03-19 22:09:10,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-19 22:09:10,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-19 22:09:10,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-19 22:09:10,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-19 22:09:10,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:09:10" (1/1) ... [2022-03-19 22:09:10,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:09:10" (1/1) ... [2022-03-19 22:09:10,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:09:10" (1/1) ... [2022-03-19 22:09:10,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:09:10" (1/1) ... [2022-03-19 22:09:10,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:09:10" (1/1) ... [2022-03-19 22:09:10,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:09:10" (1/1) ... [2022-03-19 22:09:10,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:09:10" (1/1) ... [2022-03-19 22:09:10,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-19 22:09:10,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-19 22:09:10,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-19 22:09:10,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-19 22:09:10,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:09:10" (1/1) ... [2022-03-19 22:09:10,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 22:09:10,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:09:10,589 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-03-19 22:09:10,659 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-03-19 22:09:10,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-19 22:09:10,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-19 22:09:10,690 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-19 22:09:10,690 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-19 22:09:10,691 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-19 22:09:10,691 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-19 22:09:10,691 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-19 22:09:10,691 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-03-19 22:09:10,691 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-03-19 22:09:10,691 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-19 22:09:10,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-19 22:09:10,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-19 22:09:10,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-03-19 22:09:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-19 22:09:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-19 22:09:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-19 22:09:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-19 22:09:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-19 22:09:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-19 22:09:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-19 22:09:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-19 22:09:10,774 INFO L234 CfgBuilder]: Building ICFG [2022-03-19 22:09:10,775 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-19 22:09:10,959 INFO L275 CfgBuilder]: Performing block encoding [2022-03-19 22:09:10,965 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-19 22:09:10,965 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-03-19 22:09:10,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 10:09:10 BoogieIcfgContainer [2022-03-19 22:09:10,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-19 22:09:10,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-19 22:09:10,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-19 22:09:10,973 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-19 22:09:10,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 10:09:10" (1/3) ... [2022-03-19 22:09:10,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730e03cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 10:09:10, skipping insertion in model container [2022-03-19 22:09:10,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:09:10" (2/3) ... [2022-03-19 22:09:10,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730e03cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 10:09:10, skipping insertion in model container [2022-03-19 22:09:10,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 10:09:10" (3/3) ... [2022-03-19 22:09:10,975 INFO L111 eAbstractionObserver]: Analyzing ICFG vogal-2.i [2022-03-19 22:09:10,978 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-19 22:09:10,978 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-19 22:09:11,018 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-19 22:09:11,022 INFO L340 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=PETRI_NET, 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 [2022-03-19 22:09:11,022 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-19 22:09:11,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 22:09:11,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-19 22:09:11,047 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:09:11,047 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:09:11,047 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:09:11,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:09:11,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1427166884, now seen corresponding path program 1 times [2022-03-19 22:09:11,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:09:11,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712156154] [2022-03-19 22:09:11,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:09:11,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:09:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:11,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:09:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:11,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:09:11,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:09:11,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712156154] [2022-03-19 22:09:11,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712156154] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 22:09:11,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 22:09:11,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-19 22:09:11,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598892744] [2022-03-19 22:09:11,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 22:09:11,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-19 22:09:11,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:09:11,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-19 22:09:11,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-19 22:09:11,276 INFO L87 Difference]: Start difference. First operand has 36 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:11,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:09:11,326 INFO L93 Difference]: Finished difference Result 64 states and 91 transitions. [2022-03-19 22:09:11,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-19 22:09:11,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-19 22:09:11,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:09:11,332 INFO L225 Difference]: With dead ends: 64 [2022-03-19 22:09:11,332 INFO L226 Difference]: Without dead ends: 29 [2022-03-19 22:09:11,334 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-19 22:09:11,336 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 34 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 22:09:11,336 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 45 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 22:09:11,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-03-19 22:09:11,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-03-19 22:09:11,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-03-19 22:09:11,364 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 17 [2022-03-19 22:09:11,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:09:11,365 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-03-19 22:09:11,365 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:11,365 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-03-19 22:09:11,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-19 22:09:11,366 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:09:11,366 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:09:11,366 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-19 22:09:11,367 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:09:11,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:09:11,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1183431677, now seen corresponding path program 1 times [2022-03-19 22:09:11,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:09:11,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818396727] [2022-03-19 22:09:11,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:09:11,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:09:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:11,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:09:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:09:11,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:09:11,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818396727] [2022-03-19 22:09:11,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818396727] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 22:09:11,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 22:09:11,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 22:09:11,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599236134] [2022-03-19 22:09:11,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 22:09:11,479 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 22:09:11,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:09:11,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 22:09:11,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 22:09:11,481 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:11,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:09:11,572 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-03-19 22:09:11,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 22:09:11,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-19 22:09:11,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:09:11,576 INFO L225 Difference]: With dead ends: 65 [2022-03-19 22:09:11,576 INFO L226 Difference]: Without dead ends: 44 [2022-03-19 22:09:11,580 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03-19 22:09:11,581 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 63 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 22:09:11,582 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 34 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 22:09:11,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-03-19 22:09:11,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-03-19 22:09:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-03-19 22:09:11,594 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 19 [2022-03-19 22:09:11,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:09:11,596 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-03-19 22:09:11,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:11,596 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-03-19 22:09:11,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-19 22:09:11,596 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:09:11,597 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:09:11,597 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-19 22:09:11,597 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:09:11,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:09:11,597 INFO L85 PathProgramCache]: Analyzing trace with hash -742748965, now seen corresponding path program 1 times [2022-03-19 22:09:11,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:09:11,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194568851] [2022-03-19 22:09:11,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:09:11,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:09:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:11,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:09:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:09:11,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:09:11,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194568851] [2022-03-19 22:09:11,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194568851] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:09:11,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435260616] [2022-03-19 22:09:11,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:09:11,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:09:11,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:09:11,701 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-03-19 22:09:11,702 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-03-19 22:09:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:11,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-19 22:09:11,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:09:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 22:09:11,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-19 22:09:11,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435260616] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 22:09:11,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-19 22:09:11,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2022-03-19 22:09:11,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103152587] [2022-03-19 22:09:11,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 22:09:11,839 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 22:09:11,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:09:11,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 22:09:11,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-19 22:09:11,840 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:11,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:09:11,889 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2022-03-19 22:09:11,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 22:09:11,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-03-19 22:09:11,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:09:11,890 INFO L225 Difference]: With dead ends: 54 [2022-03-19 22:09:11,890 INFO L226 Difference]: Without dead ends: 49 [2022-03-19 22:09:11,890 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-03-19 22:09:11,891 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 25 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 169 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-03-19 22:09:11,891 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 169 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 22:09:11,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-03-19 22:09:11,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2022-03-19 22:09:11,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2022-03-19 22:09:11,917 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 21 [2022-03-19 22:09:11,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:09:11,917 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2022-03-19 22:09:11,917 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:11,918 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2022-03-19 22:09:11,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-19 22:09:11,918 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:09:11,918 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:09:11,949 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-03-19 22:09:12,135 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:09:12,135 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:09:12,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:09:12,136 INFO L85 PathProgramCache]: Analyzing trace with hash -685987020, now seen corresponding path program 1 times [2022-03-19 22:09:12,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:09:12,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065515983] [2022-03-19 22:09:12,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:09:12,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:09:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:12,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:09:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:12,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-19 22:09:12,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:09:12,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065515983] [2022-03-19 22:09:12,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065515983] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:09:12,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716046917] [2022-03-19 22:09:12,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:09:12,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:09:12,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:09:12,213 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-03-19 22:09:12,214 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-03-19 22:09:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:12,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-19 22:09:12,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:09:12,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-19 22:09:12,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-19 22:09:12,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716046917] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 22:09:12,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-19 22:09:12,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-03-19 22:09:12,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734506922] [2022-03-19 22:09:12,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 22:09:12,310 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 22:09:12,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:09:12,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 22:09:12,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-19 22:09:12,311 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:12,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:09:12,330 INFO L93 Difference]: Finished difference Result 99 states and 132 transitions. [2022-03-19 22:09:12,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 22:09:12,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-03-19 22:09:12,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:09:12,331 INFO L225 Difference]: With dead ends: 99 [2022-03-19 22:09:12,331 INFO L226 Difference]: Without dead ends: 70 [2022-03-19 22:09:12,332 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-19 22:09:12,332 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 27 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 22:09:12,333 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 67 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 22:09:12,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-03-19 22:09:12,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 46. [2022-03-19 22:09:12,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2022-03-19 22:09:12,337 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 27 [2022-03-19 22:09:12,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:09:12,338 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2022-03-19 22:09:12,338 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:12,338 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2022-03-19 22:09:12,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-19 22:09:12,338 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:09:12,339 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:09:12,357 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-03-19 22:09:12,555 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-19 22:09:12,555 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:09:12,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:09:12,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1914524167, now seen corresponding path program 1 times [2022-03-19 22:09:12,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:09:12,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508918167] [2022-03-19 22:09:12,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:09:12,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:09:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:12,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:09:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-19 22:09:12,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:09:12,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508918167] [2022-03-19 22:09:12,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508918167] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:09:12,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652527336] [2022-03-19 22:09:12,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:09:12,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:09:12,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:09:12,647 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-03-19 22:09:12,652 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-03-19 22:09:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:12,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-19 22:09:12,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:09:12,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-03-19 22:09:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 22:09:12,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:09:13,027 INFO L356 Elim1Store]: treesize reduction 38, result has 11.6 percent of original size [2022-03-19 22:09:13,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 31 [2022-03-19 22:09:13,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-19 22:09:13,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652527336] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-19 22:09:13,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-19 22:09:13,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 9] total 16 [2022-03-19 22:09:13,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839078895] [2022-03-19 22:09:13,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 22:09:13,090 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 22:09:13,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:09:13,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 22:09:13,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-03-19 22:09:13,091 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:13,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:09:13,208 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2022-03-19 22:09:13,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 22:09:13,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-03-19 22:09:13,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:09:13,210 INFO L225 Difference]: With dead ends: 66 [2022-03-19 22:09:13,210 INFO L226 Difference]: Without dead ends: 44 [2022-03-19 22:09:13,210 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2022-03-19 22:09:13,211 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 11 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 22:09:13,211 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 161 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 22:09:13,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-03-19 22:09:13,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-03-19 22:09:13,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:13,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-03-19 22:09:13,218 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 28 [2022-03-19 22:09:13,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:09:13,218 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-03-19 22:09:13,219 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-03-19 22:09:13,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-19 22:09:13,219 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:09:13,219 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:09:13,240 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-03-19 22:09:13,427 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:09:13,428 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:09:13,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:09:13,428 INFO L85 PathProgramCache]: Analyzing trace with hash 109377679, now seen corresponding path program 1 times [2022-03-19 22:09:13,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:09:13,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991312704] [2022-03-19 22:09:13,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:09:13,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:09:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:13,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:09:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-19 22:09:13,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:09:13,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991312704] [2022-03-19 22:09:13,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991312704] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:09:13,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124372158] [2022-03-19 22:09:13,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:09:13,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:09:13,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:09:13,475 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-03-19 22:09:13,476 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-03-19 22:09:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:13,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-19 22:09:13,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:09:13,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-03-19 22:09:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-19 22:09:13,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:09:13,800 INFO L356 Elim1Store]: treesize reduction 38, result has 11.6 percent of original size [2022-03-19 22:09:13,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 32 [2022-03-19 22:09:13,841 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-19 22:09:13,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124372158] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:09:13,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:09:13,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 7] total 16 [2022-03-19 22:09:13,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968377169] [2022-03-19 22:09:13,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:09:13,843 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-19 22:09:13,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:09:13,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-19 22:09:13,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-03-19 22:09:13,844 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:14,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:09:14,192 INFO L93 Difference]: Finished difference Result 165 states and 224 transitions. [2022-03-19 22:09:14,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-19 22:09:14,193 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-03-19 22:09:14,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:09:14,194 INFO L225 Difference]: With dead ends: 165 [2022-03-19 22:09:14,194 INFO L226 Difference]: Without dead ends: 130 [2022-03-19 22:09:14,194 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2022-03-19 22:09:14,195 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 376 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 22:09:14,195 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 63 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 22:09:14,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-03-19 22:09:14,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 48. [2022-03-19 22:09:14,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:14,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2022-03-19 22:09:14,202 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 29 [2022-03-19 22:09:14,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:09:14,202 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2022-03-19 22:09:14,202 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:14,202 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-03-19 22:09:14,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-19 22:09:14,203 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:09:14,203 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:09:14,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-19 22:09:14,419 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:09:14,420 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:09:14,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:09:14,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1564564384, now seen corresponding path program 1 times [2022-03-19 22:09:14,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:09:14,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245619700] [2022-03-19 22:09:14,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:09:14,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:09:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:14,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:09:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-19 22:09:14,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:09:14,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245619700] [2022-03-19 22:09:14,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245619700] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:09:14,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727621367] [2022-03-19 22:09:14,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:09:14,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:09:14,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:09:14,498 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-03-19 22:09:14,499 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-03-19 22:09:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:14,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-19 22:09:14,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:09:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-19 22:09:14,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:09:14,646 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-19 22:09:14,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727621367] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:09:14,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:09:14,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 10 [2022-03-19 22:09:14,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116936365] [2022-03-19 22:09:14,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:09:14,648 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-19 22:09:14,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:09:14,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-19 22:09:14,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-03-19 22:09:14,649 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:15,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:09:15,124 INFO L93 Difference]: Finished difference Result 318 states and 473 transitions. [2022-03-19 22:09:15,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-19 22:09:15,124 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-03-19 22:09:15,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:09:15,125 INFO L225 Difference]: With dead ends: 318 [2022-03-19 22:09:15,125 INFO L226 Difference]: Without dead ends: 281 [2022-03-19 22:09:15,126 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=228, Invalid=584, Unknown=0, NotChecked=0, Total=812 [2022-03-19 22:09:15,127 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 457 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-19 22:09:15,127 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [457 Valid, 67 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-19 22:09:15,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-03-19 22:09:15,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 78. [2022-03-19 22:09:15,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 73 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:15,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 98 transitions. [2022-03-19 22:09:15,139 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 98 transitions. Word has length 32 [2022-03-19 22:09:15,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:09:15,139 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 98 transitions. [2022-03-19 22:09:15,139 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:15,140 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 98 transitions. [2022-03-19 22:09:15,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-19 22:09:15,140 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:09:15,140 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:09:15,161 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-03-19 22:09:15,357 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:09:15,357 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:09:15,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:09:15,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1773758044, now seen corresponding path program 2 times [2022-03-19 22:09:15,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:09:15,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775269933] [2022-03-19 22:09:15,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:09:15,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:09:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:15,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:09:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:15,422 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-03-19 22:09:15,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:09:15,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775269933] [2022-03-19 22:09:15,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775269933] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:09:15,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349378924] [2022-03-19 22:09:15,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 22:09:15,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:09:15,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:09:15,424 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-03-19 22:09:15,425 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-03-19 22:09:15,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 22:09:15,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:09:15,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-19 22:09:15,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:09:15,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-19 22:09:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-03-19 22:09:15,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:09:16,081 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-03-19 22:09:16,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349378924] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:09:16,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:09:16,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 11] total 22 [2022-03-19 22:09:16,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278289891] [2022-03-19 22:09:16,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:09:16,082 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-19 22:09:16,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:09:16,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-19 22:09:16,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2022-03-19 22:09:16,083 INFO L87 Difference]: Start difference. First operand 78 states and 98 transitions. Second operand has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:17,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:09:17,854 INFO L93 Difference]: Finished difference Result 1117 states and 1494 transitions. [2022-03-19 22:09:17,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-19 22:09:17,855 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-03-19 22:09:17,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:09:17,858 INFO L225 Difference]: With dead ends: 1117 [2022-03-19 22:09:17,858 INFO L226 Difference]: Without dead ends: 1052 [2022-03-19 22:09:17,860 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=779, Invalid=3253, Unknown=0, NotChecked=0, Total=4032 [2022-03-19 22:09:17,861 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 1187 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-19 22:09:17,861 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1187 Valid, 110 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-19 22:09:17,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2022-03-19 22:09:17,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 134. [2022-03-19 22:09:17,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.302325581395349) internal successors, (168), 129 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:17,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 172 transitions. [2022-03-19 22:09:17,885 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 172 transitions. Word has length 43 [2022-03-19 22:09:17,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:09:17,886 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 172 transitions. [2022-03-19 22:09:17,886 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:17,886 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 172 transitions. [2022-03-19 22:09:17,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-19 22:09:17,887 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:09:17,887 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:09:17,905 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-03-19 22:09:18,103 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:09:18,104 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:09:18,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:09:18,104 INFO L85 PathProgramCache]: Analyzing trace with hash 354065235, now seen corresponding path program 3 times [2022-03-19 22:09:18,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:09:18,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627936559] [2022-03-19 22:09:18,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:09:18,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:09:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:18,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:09:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:18,173 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-03-19 22:09:18,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:09:18,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627936559] [2022-03-19 22:09:18,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627936559] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:09:18,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466808426] [2022-03-19 22:09:18,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-19 22:09:18,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:09:18,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:09:18,175 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:09:18,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-19 22:09:18,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-19 22:09:18,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:09:18,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-19 22:09:18,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:09:18,474 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-19 22:09:18,475 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-19 22:09:18,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-03-19 22:09:18,508 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-03-19 22:09:18,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:09:18,688 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-19 22:09:18,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 1 [2022-03-19 22:09:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-03-19 22:09:18,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466808426] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-19 22:09:18,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-19 22:09:18,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8, 10] total 24 [2022-03-19 22:09:18,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115674041] [2022-03-19 22:09:18,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 22:09:18,712 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-19 22:09:18,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:09:18,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-19 22:09:18,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2022-03-19 22:09:18,713 INFO L87 Difference]: Start difference. First operand 134 states and 172 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:18,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:09:18,815 INFO L93 Difference]: Finished difference Result 207 states and 266 transitions. [2022-03-19 22:09:18,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 22:09:18,815 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-03-19 22:09:18,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:09:18,816 INFO L225 Difference]: With dead ends: 207 [2022-03-19 22:09:18,816 INFO L226 Difference]: Without dead ends: 137 [2022-03-19 22:09:18,817 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2022-03-19 22:09:18,817 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 75 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 22:09:18,817 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 146 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 22:09:18,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-03-19 22:09:18,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 101. [2022-03-19 22:09:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.28125) internal successors, (123), 96 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:18,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 127 transitions. [2022-03-19 22:09:18,833 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 127 transitions. Word has length 51 [2022-03-19 22:09:18,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:09:18,833 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 127 transitions. [2022-03-19 22:09:18,833 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:18,833 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 127 transitions. [2022-03-19 22:09:18,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-03-19 22:09:18,834 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:09:18,834 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:09:18,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-19 22:09:19,041 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:09:19,041 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:09:19,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:09:19,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1701317664, now seen corresponding path program 1 times [2022-03-19 22:09:19,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:09:19,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547804237] [2022-03-19 22:09:19,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:09:19,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:09:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:19,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:09:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:19,153 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-03-19 22:09:19,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:09:19,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547804237] [2022-03-19 22:09:19,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547804237] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:09:19,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418241847] [2022-03-19 22:09:19,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:09:19,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:09:19,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:09:19,155 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:09:19,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-19 22:09:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:19,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-19 22:09:19,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:09:19,342 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-19 22:09:19,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:09:19,460 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-19 22:09:19,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418241847] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:09:19,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:09:19,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-03-19 22:09:19,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344365759] [2022-03-19 22:09:19,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:09:19,461 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-19 22:09:19,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:09:19,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-19 22:09:19,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-03-19 22:09:19,462 INFO L87 Difference]: Start difference. First operand 101 states and 127 transitions. Second operand has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 17 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:22,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:09:22,558 INFO L93 Difference]: Finished difference Result 914 states and 1369 transitions. [2022-03-19 22:09:22,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-19 22:09:22,559 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 17 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-03-19 22:09:22,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:09:22,582 INFO L225 Difference]: With dead ends: 914 [2022-03-19 22:09:22,583 INFO L226 Difference]: Without dead ends: 828 [2022-03-19 22:09:22,585 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2153 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1335, Invalid=5471, Unknown=0, NotChecked=0, Total=6806 [2022-03-19 22:09:22,586 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 1448 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1961 mSolverCounterSat, 507 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1448 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 2468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 507 IncrementalHoareTripleChecker+Valid, 1961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-19 22:09:22,586 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1448 Valid, 174 Invalid, 2468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [507 Valid, 1961 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-19 22:09:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2022-03-19 22:09:22,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 211. [2022-03-19 22:09:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 206 states have (on average 1.3058252427184467) internal successors, (269), 206 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:22,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 273 transitions. [2022-03-19 22:09:22,615 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 273 transitions. Word has length 54 [2022-03-19 22:09:22,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:09:22,616 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 273 transitions. [2022-03-19 22:09:22,616 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 17 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:22,616 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 273 transitions. [2022-03-19 22:09:22,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-03-19 22:09:22,619 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:09:22,619 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:09:22,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-19 22:09:22,836 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-19 22:09:22,836 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:09:22,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:09:22,837 INFO L85 PathProgramCache]: Analyzing trace with hash -917908830, now seen corresponding path program 2 times [2022-03-19 22:09:22,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:09:22,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433172817] [2022-03-19 22:09:22,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:09:22,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:09:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:22,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:09:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:22,958 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2022-03-19 22:09:22,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:09:22,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433172817] [2022-03-19 22:09:22,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433172817] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:09:22,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743295458] [2022-03-19 22:09:22,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 22:09:22,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:09:22,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:09:22,960 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:09:22,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-19 22:09:23,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 22:09:23,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:09:23,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-19 22:09:23,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:09:23,225 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2022-03-19 22:09:23,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:09:23,420 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2022-03-19 22:09:23,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743295458] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:09:23,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:09:23,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-03-19 22:09:23,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477680882] [2022-03-19 22:09:23,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:09:23,422 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-19 22:09:23,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:09:23,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-19 22:09:23,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-03-19 22:09:23,422 INFO L87 Difference]: Start difference. First operand 211 states and 273 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:24,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:09:24,294 INFO L93 Difference]: Finished difference Result 1656 states and 2210 transitions. [2022-03-19 22:09:24,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-19 22:09:24,294 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-03-19 22:09:24,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:09:24,298 INFO L225 Difference]: With dead ends: 1656 [2022-03-19 22:09:24,298 INFO L226 Difference]: Without dead ends: 1462 [2022-03-19 22:09:24,304 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-03-19 22:09:24,304 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 598 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-19 22:09:24,305 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [598 Valid, 116 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-19 22:09:24,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2022-03-19 22:09:24,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 221. [2022-03-19 22:09:24,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 216 states have (on average 1.2916666666666667) internal successors, (279), 216 states have internal predecessors, (279), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:24,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 283 transitions. [2022-03-19 22:09:24,347 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 283 transitions. Word has length 92 [2022-03-19 22:09:24,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:09:24,347 INFO L478 AbstractCegarLoop]: Abstraction has 221 states and 283 transitions. [2022-03-19 22:09:24,347 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:09:24,347 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 283 transitions. [2022-03-19 22:09:24,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-03-19 22:09:24,348 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:09:24,348 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:09:24,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-19 22:09:24,565 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:09:24,566 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:09:24,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:09:24,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1408087540, now seen corresponding path program 3 times [2022-03-19 22:09:24,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:09:24,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300172786] [2022-03-19 22:09:24,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:09:24,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:09:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:27,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:09:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:09:27,194 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 21 proven. 221 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-03-19 22:09:27,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:09:27,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300172786] [2022-03-19 22:09:27,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300172786] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:09:27,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525830642] [2022-03-19 22:09:27,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-19 22:09:27,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:09:27,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:09:27,196 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:09:27,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-19 22:09:28,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-03-19 22:09:28,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:09:28,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 75 conjunts are in the unsatisfiable core [2022-03-19 22:09:28,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:09:28,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-19 22:09:28,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-03-19 22:09:28,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-03-19 22:09:28,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-03-19 22:09:28,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-03-19 22:09:28,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-03-19 22:09:28,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-03-19 22:09:28,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-03-19 22:09:28,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-03-19 22:09:28,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-03-19 22:09:28,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-03-19 22:09:28,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-03-19 22:09:29,537 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 16 proven. 96 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2022-03-19 22:09:29,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:09:35,292 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_296 (Array Int Int))) (let ((.cse0 (select v_ArrVal_296 |c_main_~#string_entrada~0.offset|)) (.cse1 (select (store |c_#memory_int| |c_main_~#string_entrada~0.base| v_ArrVal_296) |c_main_~#vetor_vogais~0.base|))) (or (< .cse0 (select .cse1 (+ |c_main_~#vetor_vogais~0.offset| 7))) (not (= .cse0 (select .cse1 (+ |c_main_~#vetor_vogais~0.offset| 1))))))) is different from false [2022-03-19 22:09:35,401 WARN L833 $PredicateComparison]: unable to prove that (or (not (< (mod c_main_~i~0 4294967296) 10)) (forall ((v_ArrVal_296 (Array Int Int))) (let ((.cse0 (select v_ArrVal_296 |c_main_~#string_entrada~0.offset|)) (.cse1 (select (store |c_#memory_int| |c_main_~#string_entrada~0.base| v_ArrVal_296) |c_main_~#vetor_vogais~0.base|))) (or (< .cse0 (select .cse1 (+ |c_main_~#vetor_vogais~0.offset| 7))) (not (= .cse0 (select .cse1 (+ |c_main_~#vetor_vogais~0.offset| 1)))))))) is different from false [2022-03-19 22:09:35,417 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 65 proven. 74 refuted. 0 times theorem prover too weak. 193 trivial. 10 not checked. [2022-03-19 22:09:35,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525830642] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:09:35,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:09:35,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 15, 23] total 66 [2022-03-19 22:09:35,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455201830] [2022-03-19 22:09:35,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:09:35,419 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-03-19 22:09:35,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:09:35,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-03-19 22:09:35,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=3573, Unknown=2, NotChecked=250, Total=4290 [2022-03-19 22:09:35,420 INFO L87 Difference]: Start difference. First operand 221 states and 283 transitions. Second operand has 66 states, 66 states have (on average 2.5757575757575757) internal successors, (170), 65 states have internal predecessors, (170), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:10:42,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:10:42,586 INFO L93 Difference]: Finished difference Result 572 states and 762 transitions. [2022-03-19 22:10:42,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-03-19 22:10:42,586 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.5757575757575757) internal successors, (170), 65 states have internal predecessors, (170), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-03-19 22:10:42,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:10:42,597 INFO L225 Difference]: With dead ends: 572 [2022-03-19 22:10:42,597 INFO L226 Difference]: Without dead ends: 498 [2022-03-19 22:10:42,603 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 262 SyntacticMatches, 6 SemanticMatches, 182 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11398 ImplicationChecksByTransitivity, 71.2s TimeCoverageRelationStatistics Valid=3561, Invalid=29386, Unknown=3, NotChecked=722, Total=33672 [2022-03-19 22:10:42,603 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 497 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 1689 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 3225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1440 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-19 22:10:42,604 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [497 Valid, 175 Invalid, 3225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1689 Invalid, 0 Unknown, 1440 Unchecked, 0.9s Time] [2022-03-19 22:10:42,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-03-19 22:10:42,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 427. [2022-03-19 22:10:42,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 422 states have (on average 1.319905213270142) internal successors, (557), 422 states have internal predecessors, (557), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:10:42,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 561 transitions. [2022-03-19 22:10:42,674 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 561 transitions. Word has length 102 [2022-03-19 22:10:42,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:10:42,674 INFO L478 AbstractCegarLoop]: Abstraction has 427 states and 561 transitions. [2022-03-19 22:10:42,674 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.5757575757575757) internal successors, (170), 65 states have internal predecessors, (170), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:10:42,674 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 561 transitions. [2022-03-19 22:10:42,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-03-19 22:10:42,687 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:10:42,687 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 8, 8, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:10:42,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-19 22:10:42,894 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-19 22:10:42,894 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:10:42,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:10:42,894 INFO L85 PathProgramCache]: Analyzing trace with hash 520185162, now seen corresponding path program 1 times [2022-03-19 22:10:42,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:10:42,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279238110] [2022-03-19 22:10:42,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:10:42,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:10:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:10:43,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:10:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:10:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 52 proven. 26 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-03-19 22:10:43,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:10:43,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279238110] [2022-03-19 22:10:43,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279238110] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:10:43,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379031064] [2022-03-19 22:10:43,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:10:43,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:10:43,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:10:43,699 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:10:43,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-19 22:10:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:10:43,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-19 22:10:43,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:10:43,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-19 22:10:43,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-19 22:10:43,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-19 22:10:44,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-19 22:10:44,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-19 22:10:44,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-19 22:10:44,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-19 22:10:44,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-19 22:10:44,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-19 22:10:44,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-19 22:10:44,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-19 22:10:44,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-03-19 22:10:44,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2022-03-19 22:10:44,892 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 63 proven. 62 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2022-03-19 22:10:44,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:10:55,945 WARN L833 $PredicateComparison]: unable to prove that (forall ((|main_~#string_entrada~0.offset| Int) (v_ArrVal_363 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_main_~#string_entrada~0.base| v_ArrVal_363) |c_main_~#vetor_vogais~0.base|)) (.cse0 (select v_ArrVal_363 |main_~#string_entrada~0.offset|))) (or (< .cse0 (select .cse1 (+ |c_main_~#vetor_vogais~0.offset| 2))) (< (select .cse1 |c_main_~#vetor_vogais~0.offset|) .cse0)))) is different from false [2022-03-19 22:10:56,035 WARN L833 $PredicateComparison]: unable to prove that (or (not (< (mod c_main_~i~0 4294967296) 10)) (forall ((|main_~#string_entrada~0.offset| Int) (v_ArrVal_363 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_main_~#string_entrada~0.base| v_ArrVal_363) |c_main_~#vetor_vogais~0.base|)) (.cse0 (select v_ArrVal_363 |main_~#string_entrada~0.offset|))) (or (< .cse0 (select .cse1 (+ |c_main_~#vetor_vogais~0.offset| 2))) (< (select .cse1 |c_main_~#vetor_vogais~0.offset|) .cse0))))) is different from false [2022-03-19 22:10:56,045 WARN L833 $PredicateComparison]: unable to prove that (or (not (< (mod (+ c_main_~i~0 1) 4294967296) 10)) (forall ((|main_~#string_entrada~0.offset| Int) (v_ArrVal_363 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_main_~#string_entrada~0.base| v_ArrVal_363) |c_main_~#vetor_vogais~0.base|)) (.cse0 (select v_ArrVal_363 |main_~#string_entrada~0.offset|))) (or (< .cse0 (select .cse1 (+ |c_main_~#vetor_vogais~0.offset| 2))) (< (select .cse1 |c_main_~#vetor_vogais~0.offset|) .cse0))))) is different from false [2022-03-19 22:10:56,059 WARN L833 $PredicateComparison]: unable to prove that (or (not (< (mod (+ c_main_~i~0 1) 4294967296) 10)) (not (< (mod c_main_~i~0 4294967296) 10)) (forall ((|main_~#string_entrada~0.offset| Int) (v_ArrVal_363 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_main_~#string_entrada~0.base| v_ArrVal_363) |c_main_~#vetor_vogais~0.base|)) (.cse0 (select v_ArrVal_363 |main_~#string_entrada~0.offset|))) (or (< .cse0 (select .cse1 (+ |c_main_~#vetor_vogais~0.offset| 2))) (< (select .cse1 |c_main_~#vetor_vogais~0.offset|) .cse0))))) is different from false [2022-03-19 22:10:56,073 WARN L833 $PredicateComparison]: unable to prove that (or (not (< (mod (+ c_main_~i~0 1) 4294967296) 10)) (forall ((|main_~#string_entrada~0.offset| Int) (v_ArrVal_363 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_main_~#string_entrada~0.base| v_ArrVal_363) |c_main_~#vetor_vogais~0.base|)) (.cse0 (select v_ArrVal_363 |main_~#string_entrada~0.offset|))) (or (< .cse0 (select .cse1 (+ |c_main_~#vetor_vogais~0.offset| 2))) (< (select .cse1 |c_main_~#vetor_vogais~0.offset|) .cse0)))) (not (< (mod (+ c_main_~i~0 2) 4294967296) 10))) is different from false [2022-03-19 22:10:56,101 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 72 proven. 9 refuted. 0 times theorem prover too weak. 217 trivial. 44 not checked. [2022-03-19 22:10:56,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379031064] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:10:56,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:10:56,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 19] total 43 [2022-03-19 22:10:56,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647588129] [2022-03-19 22:10:56,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:10:56,102 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-19 22:10:56,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:10:56,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-19 22:10:56,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1211, Unknown=10, NotChecked=380, Total=1806 [2022-03-19 22:10:56,103 INFO L87 Difference]: Start difference. First operand 427 states and 561 transitions. Second operand has 43 states, 43 states have (on average 2.697674418604651) internal successors, (116), 42 states have internal predecessors, (116), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:10:59,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:10:59,242 INFO L93 Difference]: Finished difference Result 904 states and 1199 transitions. [2022-03-19 22:10:59,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-19 22:10:59,243 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.697674418604651) internal successors, (116), 42 states have internal predecessors, (116), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-03-19 22:10:59,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:10:59,245 INFO L225 Difference]: With dead ends: 904 [2022-03-19 22:10:59,245 INFO L226 Difference]: Without dead ends: 680 [2022-03-19 22:10:59,247 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 199 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1907 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=885, Invalid=6607, Unknown=10, NotChecked=870, Total=8372 [2022-03-19 22:10:59,247 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 367 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 2060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 884 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-19 22:10:59,248 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 180 Invalid, 2060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1098 Invalid, 0 Unknown, 884 Unchecked, 0.7s Time] [2022-03-19 22:10:59,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2022-03-19 22:10:59,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 570. [2022-03-19 22:10:59,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 565 states have (on average 1.3185840707964602) internal successors, (745), 565 states have internal predecessors, (745), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:10:59,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 749 transitions. [2022-03-19 22:10:59,366 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 749 transitions. Word has length 102 [2022-03-19 22:10:59,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:10:59,366 INFO L478 AbstractCegarLoop]: Abstraction has 570 states and 749 transitions. [2022-03-19 22:10:59,366 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.697674418604651) internal successors, (116), 42 states have internal predecessors, (116), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:10:59,367 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 749 transitions. [2022-03-19 22:10:59,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-03-19 22:10:59,368 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:10:59,368 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 8, 8, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:10:59,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-19 22:10:59,580 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-19 22:10:59,581 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:10:59,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:10:59,581 INFO L85 PathProgramCache]: Analyzing trace with hash 638229392, now seen corresponding path program 1 times [2022-03-19 22:10:59,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:10:59,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654019473] [2022-03-19 22:10:59,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:10:59,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:10:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:11:00,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:11:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:11:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 16 proven. 77 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2022-03-19 22:11:00,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:11:00,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654019473] [2022-03-19 22:11:00,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654019473] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:11:00,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139601032] [2022-03-19 22:11:00,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:11:00,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:11:00,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:11:00,300 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:11:00,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-19 22:11:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:11:00,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-19 22:11:00,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:11:03,085 INFO L356 Elim1Store]: treesize reduction 82, result has 65.1 percent of original size [2022-03-19 22:11:03,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 197 treesize of output 253 [2022-03-19 22:11:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 64 proven. 95 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-03-19 22:11:03,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:11:06,818 INFO L356 Elim1Store]: treesize reduction 147, result has 69.6 percent of original size [2022-03-19 22:11:06,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 226 treesize of output 437 [2022-03-19 22:11:38,787 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 104 proven. 19 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2022-03-19 22:11:38,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139601032] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:11:38,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:11:38,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 16] total 44 [2022-03-19 22:11:38,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953946501] [2022-03-19 22:11:38,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:11:38,788 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-19 22:11:38,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:11:38,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-19 22:11:38,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1678, Unknown=0, NotChecked=0, Total=1892 [2022-03-19 22:11:38,789 INFO L87 Difference]: Start difference. First operand 570 states and 749 transitions. Second operand has 44 states, 44 states have (on average 2.909090909090909) internal successors, (128), 43 states have internal predecessors, (128), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:11:43,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:11:43,387 INFO L93 Difference]: Finished difference Result 1399 states and 1908 transitions. [2022-03-19 22:11:43,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-03-19 22:11:43,388 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.909090909090909) internal successors, (128), 43 states have internal predecessors, (128), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-03-19 22:11:43,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:11:43,391 INFO L225 Difference]: With dead ends: 1399 [2022-03-19 22:11:43,391 INFO L226 Difference]: Without dead ends: 1168 [2022-03-19 22:11:43,394 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2951 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=932, Invalid=9988, Unknown=0, NotChecked=0, Total=10920 [2022-03-19 22:11:43,394 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 57 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 432 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-19 22:11:43,394 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 164 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 588 Invalid, 0 Unknown, 432 Unchecked, 0.4s Time] [2022-03-19 22:11:43,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2022-03-19 22:11:43,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 966. [2022-03-19 22:11:43,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 961 states have (on average 1.3371488033298646) internal successors, (1285), 961 states have internal predecessors, (1285), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:11:43,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1289 transitions. [2022-03-19 22:11:43,607 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1289 transitions. Word has length 102 [2022-03-19 22:11:43,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:11:43,607 INFO L478 AbstractCegarLoop]: Abstraction has 966 states and 1289 transitions. [2022-03-19 22:11:43,607 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.909090909090909) internal successors, (128), 43 states have internal predecessors, (128), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:11:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1289 transitions. [2022-03-19 22:11:43,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-03-19 22:11:43,609 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:11:43,609 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 8, 8, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:11:43,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-19 22:11:43,811 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-19 22:11:43,812 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:11:43,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:11:43,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1686396850, now seen corresponding path program 2 times [2022-03-19 22:11:43,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:11:43,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665173191] [2022-03-19 22:11:43,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:11:43,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:11:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:11:45,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:11:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:11:45,805 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 21 proven. 199 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-03-19 22:11:45,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:11:45,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665173191] [2022-03-19 22:11:45,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665173191] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:11:45,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31128806] [2022-03-19 22:11:45,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 22:11:45,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:11:45,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:11:45,807 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:11:45,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-19 22:11:45,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 22:11:45,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:11:45,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-19 22:11:45,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:11:50,463 INFO L356 Elim1Store]: treesize reduction 82, result has 65.1 percent of original size [2022-03-19 22:11:50,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 195 treesize of output 251 [2022-03-19 22:11:50,941 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 64 proven. 95 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-03-19 22:11:50,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:11:56,178 INFO L356 Elim1Store]: treesize reduction 147, result has 71.2 percent of original size [2022-03-19 22:11:56,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 234 treesize of output 465 [2022-03-19 22:13:19,052 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-19 22:13:19,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-19 22:13:19,252 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-19 22:13:19,254 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Possible infinite loop detected aux_mod_aux_mod_main_~i~0_26_37 already exists at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.tryToHandleDivModSubterm(SolveForSubjectUtils.java:202) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:577) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.solveForSubject(SolveForSubjectUtils.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.solveForSubject(PolynomialRelation.java:490) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:422) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$IDerHelper.findBestReplacementSbr(DualJunctionDer.java:311) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$IDerHelper.tryToEliminateSbr(DualJunctionDer.java:327) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:234) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:201) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:185) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:152) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminate(DualJunctionDer.java:130) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:904) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:635) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-03-19 22:13:19,259 INFO L158 Benchmark]: Toolchain (without parser) took 249053.36ms. Allocated memory was 184.5MB in the beginning and 626.0MB in the end (delta: 441.5MB). Free memory was 127.5MB in the beginning and 420.9MB in the end (delta: -293.3MB). Peak memory consumption was 369.2MB. Max. memory is 8.0GB. [2022-03-19 22:13:19,260 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 184.5MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-19 22:13:19,260 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.32ms. Allocated memory was 184.5MB in the beginning and 250.6MB in the end (delta: 66.1MB). Free memory was 127.3MB in the beginning and 220.9MB in the end (delta: -93.5MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-03-19 22:13:19,260 INFO L158 Benchmark]: Boogie Preprocessor took 37.36ms. Allocated memory is still 250.6MB. Free memory was 220.9MB in the beginning and 219.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-19 22:13:19,260 INFO L158 Benchmark]: RCFGBuilder took 448.31ms. Allocated memory is still 250.6MB. Free memory was 218.8MB in the beginning and 206.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-03-19 22:13:19,260 INFO L158 Benchmark]: TraceAbstraction took 248289.61ms. Allocated memory was 250.6MB in the beginning and 626.0MB in the end (delta: 375.4MB). Free memory was 205.7MB in the beginning and 420.9MB in the end (delta: -215.1MB). Peak memory consumption was 382.8MB. Max. memory is 8.0GB. [2022-03-19 22:13:19,261 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.09ms. Allocated memory is still 184.5MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 273.32ms. Allocated memory was 184.5MB in the beginning and 250.6MB in the end (delta: 66.1MB). Free memory was 127.3MB in the beginning and 220.9MB in the end (delta: -93.5MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.36ms. Allocated memory is still 250.6MB. Free memory was 220.9MB in the beginning and 219.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 448.31ms. Allocated memory is still 250.6MB. Free memory was 218.8MB in the beginning and 206.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 248289.61ms. Allocated memory was 250.6MB in the beginning and 626.0MB in the end (delta: 375.4MB). Free memory was 205.7MB in the beginning and 420.9MB in the end (delta: -215.1MB). Peak memory consumption was 382.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Possible infinite loop detected aux_mod_aux_mod_main_~i~0_26_37 already exists de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Possible infinite loop detected aux_mod_aux_mod_main_~i~0_26_37 already exists: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.tryToHandleDivModSubterm(SolveForSubjectUtils.java:202) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-19 22:13:19,376 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...