/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/eureka_01-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-19 21:59:41,928 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-19 21:59:41,930 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-19 21:59:41,960 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-19 21:59:41,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-19 21:59:41,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-19 21:59:41,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-19 21:59:41,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-19 21:59:41,964 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-19 21:59:41,965 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-19 21:59:41,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-19 21:59:41,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-19 21:59:41,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-19 21:59:41,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-19 21:59:41,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-19 21:59:41,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-19 21:59:41,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-19 21:59:41,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-19 21:59:41,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-19 21:59:41,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-19 21:59:41,972 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-19 21:59:41,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-19 21:59:41,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-19 21:59:41,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-19 21:59:41,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-19 21:59:41,991 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-19 21:59:41,991 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-19 21:59:41,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-19 21:59:41,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-19 21:59:41,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-19 21:59:41,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-19 21:59:41,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-19 21:59:41,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-19 21:59:41,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-19 21:59:41,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-19 21:59:41,994 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-19 21:59:41,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-19 21:59:41,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-19 21:59:41,999 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-19 21:59:41,999 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-19 21:59:42,000 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-19 21:59:42,001 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-19 21:59:42,002 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 21:59:42,020 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-19 21:59:42,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-19 21:59:42,021 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-19 21:59:42,021 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-19 21:59:42,021 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-19 21:59:42,022 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-19 21:59:42,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-19 21:59:42,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-19 21:59:42,022 INFO L138 SettingsManager]: * Use SBE=true [2022-03-19 21:59:42,023 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-19 21:59:42,023 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-19 21:59:42,023 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-19 21:59:42,023 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-19 21:59:42,023 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-19 21:59:42,023 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-19 21:59:42,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-19 21:59:42,023 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-19 21:59:42,023 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-19 21:59:42,023 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-19 21:59:42,023 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-19 21:59:42,023 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-19 21:59:42,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-19 21:59:42,024 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-19 21:59:42,024 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-19 21:59:42,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 21:59:42,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-19 21:59:42,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-19 21:59:42,024 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-19 21:59:42,024 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-19 21:59:42,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-19 21:59:42,024 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-19 21:59:42,025 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-03-19 21:59:42,025 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-19 21:59:42,025 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 21:59:42,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-19 21:59:42,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-19 21:59:42,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-19 21:59:42,206 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-19 21:59:42,206 INFO L275 PluginConnector]: CDTParser initialized [2022-03-19 21:59:42,207 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_01-1.c [2022-03-19 21:59:42,247 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a36a3b10/269129f45d014b6dacfeb1acc4c1db8b/FLAGaaba46d18 [2022-03-19 21:59:42,624 INFO L306 CDTParser]: Found 1 translation units. [2022-03-19 21:59:42,624 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-1.c [2022-03-19 21:59:42,628 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a36a3b10/269129f45d014b6dacfeb1acc4c1db8b/FLAGaaba46d18 [2022-03-19 21:59:43,075 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a36a3b10/269129f45d014b6dacfeb1acc4c1db8b [2022-03-19 21:59:43,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-19 21:59:43,078 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-19 21:59:43,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-19 21:59:43,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-19 21:59:43,082 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-19 21:59:43,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 09:59:43" (1/1) ... [2022-03-19 21:59:43,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca16dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:43, skipping insertion in model container [2022-03-19 21:59:43,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 09:59:43" (1/1) ... [2022-03-19 21:59:43,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-19 21:59:43,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-19 21:59:43,245 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/eureka_01-1.c[446,459] [2022-03-19 21:59:43,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 21:59:43,270 INFO L203 MainTranslator]: Completed pre-run [2022-03-19 21:59:43,277 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/eureka_01-1.c[446,459] [2022-03-19 21:59:43,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 21:59:43,302 INFO L208 MainTranslator]: Completed translation [2022-03-19 21:59:43,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:43 WrapperNode [2022-03-19 21:59:43,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-19 21:59:43,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-19 21:59:43,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-19 21:59:43,303 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-19 21:59:43,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:43" (1/1) ... [2022-03-19 21:59:43,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:43" (1/1) ... [2022-03-19 21:59:43,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:43" (1/1) ... [2022-03-19 21:59:43,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:43" (1/1) ... [2022-03-19 21:59:43,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:43" (1/1) ... [2022-03-19 21:59:43,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:43" (1/1) ... [2022-03-19 21:59:43,331 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:43" (1/1) ... [2022-03-19 21:59:43,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-19 21:59:43,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-19 21:59:43,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-19 21:59:43,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-19 21:59:43,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:43" (1/1) ... [2022-03-19 21:59:43,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 21:59:43,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 21:59:43,357 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 21:59:43,372 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 21:59:43,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-19 21:59:43,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-19 21:59:43,383 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-19 21:59:43,383 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-19 21:59:43,383 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-19 21:59:43,383 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-19 21:59:43,384 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-19 21:59:43,384 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-19 21:59:43,384 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-19 21:59:43,384 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-19 21:59:43,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-19 21:59:43,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-19 21:59:43,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-19 21:59:43,384 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-19 21:59:43,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-19 21:59:43,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-19 21:59:43,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-19 21:59:43,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-19 21:59:43,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-19 21:59:43,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-19 21:59:43,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-19 21:59:43,442 INFO L234 CfgBuilder]: Building ICFG [2022-03-19 21:59:43,444 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-19 21:59:43,670 INFO L275 CfgBuilder]: Performing block encoding [2022-03-19 21:59:43,673 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-19 21:59:43,674 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-03-19 21:59:43,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 09:59:43 BoogieIcfgContainer [2022-03-19 21:59:43,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-19 21:59:43,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-19 21:59:43,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-19 21:59:43,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-19 21:59:43,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 09:59:43" (1/3) ... [2022-03-19 21:59:43,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a73460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 09:59:43, skipping insertion in model container [2022-03-19 21:59:43,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:43" (2/3) ... [2022-03-19 21:59:43,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a73460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 09:59:43, skipping insertion in model container [2022-03-19 21:59:43,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 09:59:43" (3/3) ... [2022-03-19 21:59:43,680 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_01-1.c [2022-03-19 21:59:43,683 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-19 21:59:43,684 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-19 21:59:43,710 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-19 21:59:43,714 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 21:59:43,715 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-19 21:59:43,724 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 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 21:59:43,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-19 21:59:43,727 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 21:59:43,727 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 21:59:43,728 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 21:59:43,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 21:59:43,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1703238628, now seen corresponding path program 1 times [2022-03-19 21:59:43,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 21:59:43,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308287263] [2022-03-19 21:59:43,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:43,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 21:59:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:43,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 21:59:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:43,957 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 21:59:43,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 21:59:43,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308287263] [2022-03-19 21:59:43,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308287263] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 21:59:43,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 21:59:43,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-19 21:59:43,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132189764] [2022-03-19 21:59:43,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 21:59:43,964 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-19 21:59:43,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 21:59:43,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-19 21:59:43,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-19 21:59:43,988 INFO L87 Difference]: Start difference. First operand has 37 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 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 5.0) internal successors, (15), 2 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 21:59:44,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 21:59:44,024 INFO L93 Difference]: Finished difference Result 63 states and 89 transitions. [2022-03-19 21:59:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-19 21:59:44,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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 21:59:44,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 21:59:44,032 INFO L225 Difference]: With dead ends: 63 [2022-03-19 21:59:44,033 INFO L226 Difference]: Without dead ends: 32 [2022-03-19 21:59:44,035 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 21:59:44,039 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 37 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 21:59:44,040 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 47 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 21:59:44,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-03-19 21:59:44,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-03-19 21:59:44,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-19 21:59:44,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-03-19 21:59:44,068 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 19 [2022-03-19 21:59:44,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 21:59:44,068 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-03-19 21:59:44,069 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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 21:59:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-03-19 21:59:44,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-19 21:59:44,070 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 21:59:44,070 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 21:59:44,070 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-19 21:59:44,071 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 21:59:44,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 21:59:44,074 INFO L85 PathProgramCache]: Analyzing trace with hash -779965392, now seen corresponding path program 1 times [2022-03-19 21:59:44,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 21:59:44,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41577982] [2022-03-19 21:59:44,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:44,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 21:59:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:44,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 21:59:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:44,254 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 21:59:44,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 21:59:44,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41577982] [2022-03-19 21:59:44,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41577982] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 21:59:44,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 21:59:44,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 21:59:44,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693272169] [2022-03-19 21:59:44,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 21:59:44,261 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 21:59:44,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 21:59:44,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 21:59:44,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-19 21:59:44,262 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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 21:59:44,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 21:59:44,452 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2022-03-19 21:59:44,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 21:59:44,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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 21:59:44,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 21:59:44,456 INFO L225 Difference]: With dead ends: 80 [2022-03-19 21:59:44,456 INFO L226 Difference]: Without dead ends: 48 [2022-03-19 21:59:44,460 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-19 21:59:44,462 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 85 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 21:59:44,462 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 36 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 21:59:44,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-19 21:59:44,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2022-03-19 21:59:44,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-19 21:59:44,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-03-19 21:59:44,477 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 19 [2022-03-19 21:59:44,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 21:59:44,480 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-03-19 21:59:44,483 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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 21:59:44,484 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-03-19 21:59:44,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-19 21:59:44,484 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 21:59:44,484 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] [2022-03-19 21:59:44,485 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-19 21:59:44,485 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 21:59:44,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 21:59:44,486 INFO L85 PathProgramCache]: Analyzing trace with hash 470194446, now seen corresponding path program 1 times [2022-03-19 21:59:44,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 21:59:44,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951657197] [2022-03-19 21:59:44,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:44,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 21:59:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:44,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 21:59:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:44,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 21:59:44,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 21:59:44,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951657197] [2022-03-19 21:59:44,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951657197] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 21:59:44,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357016129] [2022-03-19 21:59:44,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:44,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 21:59:44,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 21:59:44,739 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 21:59:44,767 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 21:59:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:44,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-19 21:59:44,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 21:59:44,944 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 11 treesize of output 7 [2022-03-19 21:59:45,055 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 21:59:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 21:59:45,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 21:59:45,202 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 14 treesize of output 12 [2022-03-19 21:59:45,205 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 26 treesize of output 24 [2022-03-19 21:59:45,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 21:59:45,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357016129] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 21:59:45,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 21:59:45,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-03-19 21:59:45,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052023549] [2022-03-19 21:59:45,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 21:59:45,232 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-19 21:59:45,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 21:59:45,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-19 21:59:45,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-03-19 21:59:45,233 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 21:59:45,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 21:59:45,669 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2022-03-19 21:59:45,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-19 21:59:45,670 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-03-19 21:59:45,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 21:59:45,671 INFO L225 Difference]: With dead ends: 91 [2022-03-19 21:59:45,671 INFO L226 Difference]: Without dead ends: 89 [2022-03-19 21:59:45,672 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2022-03-19 21:59:45,673 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 157 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-19 21:59:45,673 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 72 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-19 21:59:45,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-03-19 21:59:45,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 55. [2022-03-19 21:59:45,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 48 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 21:59:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2022-03-19 21:59:45,679 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 25 [2022-03-19 21:59:45,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 21:59:45,680 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2022-03-19 21:59:45,680 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 21:59:45,680 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2022-03-19 21:59:45,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-19 21:59:45,681 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 21:59:45,681 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] [2022-03-19 21:59:45,702 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 21:59:45,895 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 21:59:45,896 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 21:59:45,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 21:59:45,896 INFO L85 PathProgramCache]: Analyzing trace with hash -550873908, now seen corresponding path program 1 times [2022-03-19 21:59:45,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 21:59:45,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491923942] [2022-03-19 21:59:45,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:45,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 21:59:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:45,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 21:59:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:45,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 21:59:45,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 21:59:45,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491923942] [2022-03-19 21:59:45,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491923942] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 21:59:45,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 21:59:45,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 21:59:45,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774266475] [2022-03-19 21:59:45,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 21:59:45,963 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 21:59:45,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 21:59:45,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 21:59:45,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 21:59:45,963 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 21:59:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 21:59:46,011 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-03-19 21:59:46,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 21:59:46,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 25 [2022-03-19 21:59:46,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 21:59:46,015 INFO L225 Difference]: With dead ends: 82 [2022-03-19 21:59:46,016 INFO L226 Difference]: Without dead ends: 57 [2022-03-19 21:59:46,016 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 21:59:46,017 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 34 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 21:59:46,018 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 40 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 21:59:46,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-03-19 21:59:46,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-03-19 21:59:46,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 49 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 21:59:46,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2022-03-19 21:59:46,034 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 25 [2022-03-19 21:59:46,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 21:59:46,034 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2022-03-19 21:59:46,034 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 21:59:46,034 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2022-03-19 21:59:46,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-19 21:59:46,036 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 21:59:46,036 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, 1] [2022-03-19 21:59:46,036 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-19 21:59:46,036 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 21:59:46,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 21:59:46,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1439064257, now seen corresponding path program 1 times [2022-03-19 21:59:46,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 21:59:46,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14710815] [2022-03-19 21:59:46,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:46,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 21:59:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:46,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 21:59:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:46,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 21:59:46,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 21:59:46,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14710815] [2022-03-19 21:59:46,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14710815] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 21:59:46,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712161160] [2022-03-19 21:59:46,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:46,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 21:59:46,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 21:59:46,120 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 21:59:46,150 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 21:59:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:46,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-19 21:59:46,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 21:59:46,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 21:59:46,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 21:59:46,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 21:59:46,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712161160] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 21:59:46,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 21:59:46,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-03-19 21:59:46,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091791362] [2022-03-19 21:59:46,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 21:59:46,299 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-19 21:59:46,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 21:59:46,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-19 21:59:46,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-03-19 21:59:46,300 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 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 21:59:46,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 21:59:46,564 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2022-03-19 21:59:46,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 21:59:46,565 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 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 28 [2022-03-19 21:59:46,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 21:59:46,566 INFO L225 Difference]: With dead ends: 130 [2022-03-19 21:59:46,566 INFO L226 Difference]: Without dead ends: 94 [2022-03-19 21:59:46,566 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-03-19 21:59:46,566 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 111 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 21:59:46,567 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 63 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 21:59:46,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-03-19 21:59:46,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2022-03-19 21:59:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 61 states have internal predecessors, (77), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 21:59:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2022-03-19 21:59:46,573 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 28 [2022-03-19 21:59:46,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 21:59:46,574 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2022-03-19 21:59:46,574 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 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 21:59:46,574 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2022-03-19 21:59:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-19 21:59:46,574 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 21:59:46,574 INFO L499 BasicCegarLoop]: trace histogram [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 21:59:46,597 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 21:59:46,793 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 21:59:46,793 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 21:59:46,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 21:59:46,794 INFO L85 PathProgramCache]: Analyzing trace with hash 244787668, now seen corresponding path program 1 times [2022-03-19 21:59:46,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 21:59:46,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267941021] [2022-03-19 21:59:46,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:46,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 21:59:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:46,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 21:59:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:46,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 21:59:46,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 21:59:46,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267941021] [2022-03-19 21:59:46,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267941021] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 21:59:46,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058199543] [2022-03-19 21:59:46,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:46,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 21:59:46,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 21:59:46,864 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 21:59:46,865 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 21:59:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:46,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-19 21:59:46,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 21:59:46,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 21:59:46,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 21:59:47,035 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 21:59:47,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058199543] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 21:59:47,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 21:59:47,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-03-19 21:59:47,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635566157] [2022-03-19 21:59:47,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 21:59:47,036 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-19 21:59:47,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 21:59:47,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-19 21:59:47,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-03-19 21:59:47,037 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 21:59:47,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 21:59:47,297 INFO L93 Difference]: Finished difference Result 195 states and 249 transitions. [2022-03-19 21:59:47,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-19 21:59:47,297 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 28 [2022-03-19 21:59:47,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 21:59:47,298 INFO L225 Difference]: With dead ends: 195 [2022-03-19 21:59:47,298 INFO L226 Difference]: Without dead ends: 165 [2022-03-19 21:59:47,299 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2022-03-19 21:59:47,299 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 150 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 21:59:47,299 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 80 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 21:59:47,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-03-19 21:59:47,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 87. [2022-03-19 21:59:47,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 80 states have internal predecessors, (103), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 21:59:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2022-03-19 21:59:47,308 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 28 [2022-03-19 21:59:47,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 21:59:47,308 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2022-03-19 21:59:47,308 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 21:59:47,309 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2022-03-19 21:59:47,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-19 21:59:47,309 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 21:59:47,309 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, 1, 1, 1, 1] [2022-03-19 21:59:47,340 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 21:59:47,541 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 21:59:47,541 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 21:59:47,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 21:59:47,541 INFO L85 PathProgramCache]: Analyzing trace with hash 777875589, now seen corresponding path program 1 times [2022-03-19 21:59:47,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 21:59:47,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600166240] [2022-03-19 21:59:47,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:47,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 21:59:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:47,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 21:59:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:47,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 21:59:47,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 21:59:47,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600166240] [2022-03-19 21:59:47,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600166240] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 21:59:47,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845910310] [2022-03-19 21:59:47,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:47,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 21:59:47,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 21:59:47,875 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 21:59:47,876 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 21:59:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:47,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-19 21:59:47,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 21:59:47,958 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 79 treesize of output 77 [2022-03-19 21:59:48,020 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 19 treesize of output 18 [2022-03-19 21:59:48,168 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-03-19 21:59:48,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-03-19 21:59:48,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-03-19 21:59:48,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 21:59:48,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 21:59:50,553 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_9 Int)) (or (forall ((v_ArrVal_192 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |c_main_~#distance~0.offset|) v_ArrVal_192) |c_main_~#distance~0.offset|))) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) v_main_~x~0_9)))) is different from false [2022-03-19 21:59:50,927 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int)) (or (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_9)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |c_main_~#distance~0.offset|) v_ArrVal_192) |c_main_~#distance~0.offset|)))) is different from false [2022-03-19 21:59:58,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-03-19 21:59:58,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845910310] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 21:59:58,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 21:59:58,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2022-03-19 21:59:58,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439467350] [2022-03-19 21:59:58,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 21:59:58,413 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-19 21:59:58,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 21:59:58,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-19 21:59:58,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=590, Unknown=10, NotChecked=102, Total=812 [2022-03-19 21:59:58,414 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 21:59:58,745 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int)) (or (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_9)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |c_main_~#distance~0.offset|) v_ArrVal_192) |c_main_~#distance~0.offset|)))) (= c_main_~i~0 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|)) 0) (<= |c_main_~#Dest~0.offset| 0) (<= 0 |c_main_~#Dest~0.offset|) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-03-19 21:59:59,027 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int)) (or (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_9)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |c_main_~#distance~0.offset|) v_ArrVal_192) |c_main_~#distance~0.offset|)))) (= |c_main_~#Dest~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) 0) 0)) is different from false [2022-03-19 22:00:01,068 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|))) (and (forall ((v_main_~x~0_9 Int)) (or (forall ((v_ArrVal_192 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |c_main_~#distance~0.offset|) v_ArrVal_192) |c_main_~#distance~0.offset|))) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) v_main_~x~0_9)))) (= .cse0 0) (= |c_main_~#distance~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) 0) 0) (= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) .cse0) 1) (= c_main_~j~0 0))) is different from false [2022-03-19 22:00:02,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:00:02,841 INFO L93 Difference]: Finished difference Result 146 states and 186 transitions. [2022-03-19 22:00:02,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-19 22:00:02,842 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-03-19 22:00:02,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:00:02,843 INFO L225 Difference]: With dead ends: 146 [2022-03-19 22:00:02,843 INFO L226 Difference]: Without dead ends: 144 [2022-03-19 22:00:02,844 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=205, Invalid=1206, Unknown=15, NotChecked=380, Total=1806 [2022-03-19 22:00:02,844 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 56 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 406 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 22:00:02,844 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 151 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 340 Invalid, 0 Unknown, 406 Unchecked, 0.2s Time] [2022-03-19 22:00:02,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-03-19 22:00:02,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 92. [2022-03-19 22:00:02,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 85 states have internal predecessors, (111), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 22:00:02,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 118 transitions. [2022-03-19 22:00:02,856 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 118 transitions. Word has length 31 [2022-03-19 22:00:02,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:00:02,856 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 118 transitions. [2022-03-19 22:00:02,856 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:00:02,856 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 118 transitions. [2022-03-19 22:00:02,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-19 22:00:02,857 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:00:02,857 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-03-19 22:00:02,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-19 22:00:03,057 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:00:03,058 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:00:03,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:00:03,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1819082994, now seen corresponding path program 2 times [2022-03-19 22:00:03,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:00:03,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224351527] [2022-03-19 22:00:03,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:00:03,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:00:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:03,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:00:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:03,226 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-19 22:00:03,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:00:03,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224351527] [2022-03-19 22:00:03,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224351527] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:00:03,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726775457] [2022-03-19 22:00:03,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 22:00:03,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:00:03,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:00:03,228 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:00:03,229 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:00:03,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 22:00:03,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:00:03,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-19 22:00:03,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:00:03,347 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 15 treesize of output 11 [2022-03-19 22:00:03,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-19 22:00:03,400 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 22 [2022-03-19 22:00:03,521 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:00:03,555 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-19 22:00:03,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:00:05,657 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_56 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_56)) (forall ((v_ArrVal_233 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* v_main_~i~0_56 4)) v_ArrVal_233) |c_main_~#distance~0.offset|))))) is different from false [2022-03-19 22:00:05,684 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 21 treesize of output 19 [2022-03-19 22:00:05,687 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 154 treesize of output 150 [2022-03-19 22:00:05,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 1 not checked. [2022-03-19 22:00:05,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726775457] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:00:05,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:00:05,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 22 [2022-03-19 22:00:05,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128145696] [2022-03-19 22:00:05,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:00:05,762 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-19 22:00:05,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:00:05,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-19 22:00:05,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=353, Unknown=1, NotChecked=38, Total=462 [2022-03-19 22:00:05,763 INFO L87 Difference]: Start difference. First operand 92 states and 118 transitions. Second operand has 22 states, 20 states have (on average 2.95) internal successors, (59), 19 states have internal predecessors, (59), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:00:07,801 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (= c_main_~i~0 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|)) 0) (forall ((v_main_~i~0_56 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_56)) (forall ((v_ArrVal_233 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* v_main_~i~0_56 4)) v_ArrVal_233) |c_main_~#distance~0.offset|))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-03-19 22:00:08,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:00:08,290 INFO L93 Difference]: Finished difference Result 168 states and 212 transitions. [2022-03-19 22:00:08,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-19 22:00:08,290 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.95) internal successors, (59), 19 states have internal predecessors, (59), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-03-19 22:00:08,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:00:08,291 INFO L225 Difference]: With dead ends: 168 [2022-03-19 22:00:08,291 INFO L226 Difference]: Without dead ends: 166 [2022-03-19 22:00:08,292 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=162, Invalid=774, Unknown=2, NotChecked=118, Total=1056 [2022-03-19 22:00:08,292 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 175 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-19 22:00:08,292 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 80 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 581 Invalid, 0 Unknown, 83 Unchecked, 0.3s Time] [2022-03-19 22:00:08,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-03-19 22:00:08,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 80. [2022-03-19 22:00:08,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 73 states have internal predecessors, (94), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 22:00:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2022-03-19 22:00:08,301 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 31 [2022-03-19 22:00:08,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:00:08,301 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2022-03-19 22:00:08,301 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.95) internal successors, (59), 19 states have internal predecessors, (59), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:00:08,301 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2022-03-19 22:00:08,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-19 22:00:08,302 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:00:08,302 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1] [2022-03-19 22:00:08,319 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:00:08,502 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:00:08,503 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:00:08,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:00:08,503 INFO L85 PathProgramCache]: Analyzing trace with hash -12240024, now seen corresponding path program 1 times [2022-03-19 22:00:08,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:00:08,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604310337] [2022-03-19 22:00:08,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:00:08,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:00:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:08,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:00:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:08,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 22:00:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:08,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 22:00:08,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:00:08,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604310337] [2022-03-19 22:00:08,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604310337] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:00:08,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481032674] [2022-03-19 22:00:08,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:00:08,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:00:08,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:00:08,558 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:00:08,559 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:00:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:08,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-19 22:00:08,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:00:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 22:00:08,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:00:08,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 22:00:08,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481032674] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:00:08,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:00:08,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-03-19 22:00:08,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258887963] [2022-03-19 22:00:08,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:00:08,770 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-19 22:00:08,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:00:08,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-19 22:00:08,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-03-19 22:00:08,771 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-19 22:00:09,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:00:09,071 INFO L93 Difference]: Finished difference Result 206 states and 262 transitions. [2022-03-19 22:00:09,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-19 22:00:09,071 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2022-03-19 22:00:09,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:00:09,072 INFO L225 Difference]: With dead ends: 206 [2022-03-19 22:00:09,072 INFO L226 Difference]: Without dead ends: 138 [2022-03-19 22:00:09,072 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-03-19 22:00:09,073 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 197 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 22:00:09,073 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 53 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 22:00:09,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-03-19 22:00:09,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 96. [2022-03-19 22:00:09,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 89 states have internal predecessors, (111), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 22:00:09,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2022-03-19 22:00:09,083 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 33 [2022-03-19 22:00:09,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:00:09,083 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2022-03-19 22:00:09,083 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-19 22:00:09,084 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2022-03-19 22:00:09,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-19 22:00:09,084 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:00:09,084 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2022-03-19 22:00:09,113 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:00:09,302 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:00:09,302 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:00:09,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:00:09,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1882894858, now seen corresponding path program 2 times [2022-03-19 22:00:09,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:00:09,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006159930] [2022-03-19 22:00:09,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:00:09,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:00:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:09,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:00:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:09,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 22:00:09,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:00:09,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006159930] [2022-03-19 22:00:09,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006159930] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:00:09,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478960092] [2022-03-19 22:00:09,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 22:00:09,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:00:09,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:00:09,366 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:00:09,393 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:00:09,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 22:00:09,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:00:09,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-19 22:00:09,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:00:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 22:00:09,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:00:09,589 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 22:00:09,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478960092] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:00:09,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:00:09,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-03-19 22:00:09,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366552161] [2022-03-19 22:00:09,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:00:09,591 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-19 22:00:09,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:00:09,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-19 22:00:09,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-19 22:00:09,592 INFO L87 Difference]: Start difference. First operand 96 states and 119 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 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:00:09,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:00:09,851 INFO L93 Difference]: Finished difference Result 195 states and 241 transitions. [2022-03-19 22:00:09,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-19 22:00:09,851 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 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 34 [2022-03-19 22:00:09,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:00:09,852 INFO L225 Difference]: With dead ends: 195 [2022-03-19 22:00:09,852 INFO L226 Difference]: Without dead ends: 174 [2022-03-19 22:00:09,853 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-03-19 22:00:09,853 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 117 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 22:00:09,853 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 85 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 22:00:09,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-03-19 22:00:09,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 128. [2022-03-19 22:00:09,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 119 states have (on average 1.2773109243697478) internal successors, (152), 121 states have internal predecessors, (152), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 22:00:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 160 transitions. [2022-03-19 22:00:09,870 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 160 transitions. Word has length 34 [2022-03-19 22:00:09,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:00:09,871 INFO L478 AbstractCegarLoop]: Abstraction has 128 states and 160 transitions. [2022-03-19 22:00:09,871 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 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:00:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2022-03-19 22:00:09,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-19 22:00:09,872 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:00:09,872 INFO L499 BasicCegarLoop]: trace histogram [2, 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, 1] [2022-03-19 22:00:09,901 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:00:10,090 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:00:10,090 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:00:10,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:00:10,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1470221714, now seen corresponding path program 3 times [2022-03-19 22:00:10,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:00:10,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743306902] [2022-03-19 22:00:10,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:00:10,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:00:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:10,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:00:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:00:10,913 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 22:00:10,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:00:10,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743306902] [2022-03-19 22:00:10,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743306902] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:00:10,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537794510] [2022-03-19 22:00:10,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-19 22:00:10,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:00:10,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:00:10,917 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:00:10,918 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:00:11,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-19 22:00:11,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:00:11,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-19 22:00:11,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:00:11,064 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 54 treesize of output 50 [2022-03-19 22:00:11,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-19 22:00:11,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-19 22:00:11,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-19 22:00:11,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-03-19 22:00:11,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-19 22:00:11,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-19 22:00:11,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-19 22:00:11,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-19 22:00:11,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-19 22:00:11,318 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-03-19 22:00:11,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 63 [2022-03-19 22:00:11,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-19 22:00:11,463 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-03-19 22:00:11,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 68 [2022-03-19 22:00:12,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2022-03-19 22:00:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:00:12,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:00:25,640 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int)) (or (<= v_main_~j~0_28 0) (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351))) (store .cse0 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse0) |c_main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_353)) |c_main_~#distance~0.offset|)) (not (<= v_main_~j~0_28 1)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_19)))) is different from false [2022-03-19 22:00:55,819 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-19 22:00:55,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537794510] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:00:55,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:00:55,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 48 [2022-03-19 22:00:55,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159212566] [2022-03-19 22:00:55,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:00:55,820 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-19 22:00:55,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:00:55,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-19 22:00:55,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=1832, Unknown=11, NotChecked=90, Total=2256 [2022-03-19 22:00:55,821 INFO L87 Difference]: Start difference. First operand 128 states and 160 transitions. Second operand has 48 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 45 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:00:56,489 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (let ((.cse0 (select .cse1 |c_main_~#Dest~0.offset|)) (.cse2 (select |c_#memory_int| |c_main_~#distance~0.base|))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= .cse0 1) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (= (select .cse1 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= c_main_~i~0 0) (= (select .cse2 (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|)) 0) (<= 1 .cse0) (forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int)) (or (<= v_main_~j~0_28 0) (<= 0 (select (let ((.cse3 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351))) (store .cse3 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse3) |c_main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_353)) |c_main_~#distance~0.offset|)) (not (<= v_main_~j~0_28 1)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_19)))) (<= |c_main_~#Dest~0.offset| 0) (= 3 (select .cse1 (+ 4 |c_main_~#Dest~0.offset|))) (<= 0 (select .cse2 |c_main_~#distance~0.offset|)) (<= 0 |c_main_~#Dest~0.offset|) (= |c_#NULL.offset| |c_old(#NULL.offset)|)))) is different from false [2022-03-19 22:00:57,039 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (let ((.cse0 (select .cse1 |c_main_~#Dest~0.offset|)) (.cse2 (select |c_#memory_int| |c_main_~#distance~0.base|))) (and (= .cse0 1) (= |c_main_~#distance~0.offset| 0) (= (select .cse1 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= (select .cse2 0) 0) (<= 1 .cse0) (forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int)) (or (<= v_main_~j~0_28 0) (<= 0 (select (let ((.cse3 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351))) (store .cse3 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse3) |c_main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_353)) |c_main_~#distance~0.offset|)) (not (<= v_main_~j~0_28 1)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_19)))) (= 3 (select .cse1 (+ 4 |c_main_~#Dest~0.offset|))) (<= 0 (select .cse2 |c_main_~#distance~0.offset|))))) is different from false [2022-03-19 22:00:57,857 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) (.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|)) (.cse3 (+ 4 |c_main_~#Dest~0.offset|)) (.cse2 (select |c_#memory_int| |c_main_~#distance~0.base|))) (and (<= c_main_~j~0 1) (= |c_#NULL.base| |c_old(#NULL.base)|) (= (select .cse0 .cse1) 3) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (= (select .cse0 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= (select .cse2 0) 0) (not (= (+ (* 4 c_main_~x~0) |c_main_~#distance~0.offset|) 0)) (<= 1 (select .cse0 |c_main_~#Dest~0.offset|)) (= .cse1 .cse3) (exists ((|main_~#Dest~0.base| Int)) (let ((.cse4 (select |c_#memory_int| |main_~#Dest~0.base|))) (and (<= 1 (select .cse4 0)) (= 3 (select .cse4 4)) (= (select .cse4 8) 4) (= c_main_~x~0 (select .cse4 (* c_main_~j~0 4))) (not (= |main_~#Dest~0.base| |c_main_~#distance~0.base|))))) (= 3 (select .cse0 .cse3)) (<= 0 (select .cse2 |c_main_~#distance~0.offset|)) (forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (<= 0 (select (let ((.cse5 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* 4 c_main_~x~0) |c_main_~#distance~0.offset|) v_ArrVal_351))) (store .cse5 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse5) |c_main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_353)) |c_main_~#distance~0.offset|)) (<= v_main_~j~0_28 0) (not (<= v_main_~j~0_28 (+ c_main_~j~0 1))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-03-19 22:00:59,868 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_main_~j~0 1) (forall ((v_main_~j~0_28 Int)) (or (<= v_main_~j~0_28 0) (not (<= v_main_~j~0_28 (+ c_main_~j~0 1))) (forall ((v_ArrVal_353 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_353) |c_main_~#distance~0.offset|))))) (= |c_main_~#distance~0.offset| 0) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) 0) 0) (exists ((|main_~#Dest~0.base| Int)) (let ((.cse0 (select |c_#memory_int| |main_~#Dest~0.base|))) (and (<= 1 (select .cse0 0)) (= 3 (select .cse0 4)) (= (select .cse0 8) 4) (or (= (+ (* 4 (select .cse0 (* c_main_~j~0 4))) |c_main_~#distance~0.offset|) |c_main_~#distance~0.offset|) (<= 0 (select (select |c_#memory_int| |c_main_~#distance~0.base|) |c_main_~#distance~0.offset|))) (not (= |main_~#Dest~0.base| |c_main_~#distance~0.base|))))) (= (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|) (+ 4 |c_main_~#Dest~0.offset|))) is different from false [2022-03-19 22:01:00,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:01:00,570 INFO L93 Difference]: Finished difference Result 174 states and 213 transitions. [2022-03-19 22:01:00,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-19 22:01:00,570 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 45 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-03-19 22:01:00,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:01:00,571 INFO L225 Difference]: With dead ends: 174 [2022-03-19 22:01:00,571 INFO L226 Difference]: Without dead ends: 142 [2022-03-19 22:01:00,573 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 47.6s TimeCoverageRelationStatistics Valid=592, Invalid=3969, Unknown=15, NotChecked=680, Total=5256 [2022-03-19 22:01:00,573 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 78 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 323 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-19 22:01:00,573 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 259 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 548 Invalid, 0 Unknown, 323 Unchecked, 0.3s Time] [2022-03-19 22:01:00,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-03-19 22:01:00,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 137. [2022-03-19 22:01:00,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 128 states have (on average 1.28125) internal successors, (164), 130 states have internal predecessors, (164), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 22:01:00,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 172 transitions. [2022-03-19 22:01:00,589 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 172 transitions. Word has length 37 [2022-03-19 22:01:00,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:01:00,589 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 172 transitions. [2022-03-19 22:01:00,589 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 45 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:01:00,589 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 172 transitions. [2022-03-19 22:01:00,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-19 22:01:00,590 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:01:00,590 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2022-03-19 22:01:00,612 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:01:00,790 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,SelfDestructingSolverStorable10 [2022-03-19 22:01:00,790 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:01:00,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:01:00,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1135801840, now seen corresponding path program 1 times [2022-03-19 22:01:00,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:01:00,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973007416] [2022-03-19 22:01:00,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:01:00,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:01:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:01:01,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:01:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:01:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-19 22:01:01,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:01:01,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973007416] [2022-03-19 22:01:01,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973007416] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:01:01,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29579159] [2022-03-19 22:01:01,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:01:01,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:01:01,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:01:01,140 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:01:01,141 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:01:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:01:01,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-19 22:01:01,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:01:01,231 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 66 treesize of output 62 [2022-03-19 22:01:01,281 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 19 treesize of output 18 [2022-03-19 22:01:01,400 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-03-19 22:01:01,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-03-19 22:01:01,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-03-19 22:01:01,627 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-19 22:01:01,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:01:03,733 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_24 Int)) (or (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) v_main_~x~0_24)) (forall ((v_ArrVal_396 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_24 4) |c_main_~#distance~0.offset|) v_ArrVal_396) |c_main_~#distance~0.offset|))))) is different from false [2022-03-19 22:01:04,170 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_396 Int) (v_main_~x~0_24 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_24 4) |c_main_~#distance~0.offset|) v_ArrVal_396) |c_main_~#distance~0.offset|)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_24)))) is different from false [2022-03-19 22:01:04,755 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_396 Int) (v_ArrVal_394 Int) (v_main_~x~0_24 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|) v_ArrVal_394))) (or (not (<= (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse0) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_24)) (<= 0 (select (store .cse0 (+ (* v_main_~x~0_24 4) |c_main_~#distance~0.offset|) v_ArrVal_396) |c_main_~#distance~0.offset|)) (not (<= 0 v_ArrVal_394))))) is different from false [2022-03-19 22:01:04,792 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 4 not checked. [2022-03-19 22:01:04,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29579159] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:01:04,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:01:04,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 30 [2022-03-19 22:01:04,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369262260] [2022-03-19 22:01:04,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:01:04,793 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-19 22:01:04,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:01:04,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-19 22:01:04,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=599, Unknown=3, NotChecked=156, Total=870 [2022-03-19 22:01:04,794 INFO L87 Difference]: Start difference. First operand 137 states and 172 transitions. Second operand has 30 states, 28 states have (on average 2.857142857142857) internal successors, (80), 27 states have internal predecessors, (80), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:01:06,069 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (forall ((v_ArrVal_396 Int) (v_main_~x~0_24 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_24 4) |c_main_~#distance~0.offset|) v_ArrVal_396) |c_main_~#distance~0.offset|)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_24)))) (= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (= |c_main_~#Dest~0.offset| 0) (= c_main_~i~0 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|)) 0) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-03-19 22:01:06,424 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_396 Int) (v_main_~x~0_24 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_24 4) |c_main_~#distance~0.offset|) v_ArrVal_396) |c_main_~#distance~0.offset|)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_24)))) (= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (= |c_main_~#Dest~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) 0) 0)) is different from false [2022-03-19 22:01:08,447 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|))) (and (= .cse0 0) (= |c_main_~#distance~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) 0) 0) (= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) .cse0) 1) (forall ((v_main_~x~0_24 Int)) (or (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) v_main_~x~0_24)) (forall ((v_ArrVal_396 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_24 4) |c_main_~#distance~0.offset|) v_ArrVal_396) |c_main_~#distance~0.offset|))))) (= c_main_~j~0 0))) is different from false [2022-03-19 22:01:08,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:01:08,730 INFO L93 Difference]: Finished difference Result 161 states and 198 transitions. [2022-03-19 22:01:08,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-19 22:01:08,731 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.857142857142857) internal successors, (80), 27 states have internal predecessors, (80), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-03-19 22:01:08,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:01:08,732 INFO L225 Difference]: With dead ends: 161 [2022-03-19 22:01:08,732 INFO L226 Difference]: Without dead ends: 142 [2022-03-19 22:01:08,732 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=186, Invalid=1092, Unknown=6, NotChecked=438, Total=1722 [2022-03-19 22:01:08,733 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 48 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 22:01:08,733 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 217 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 377 Invalid, 0 Unknown, 177 Unchecked, 0.2s Time] [2022-03-19 22:01:08,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-03-19 22:01:08,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2022-03-19 22:01:08,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 125 states have (on average 1.28) internal successors, (160), 127 states have internal predecessors, (160), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 22:01:08,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 168 transitions. [2022-03-19 22:01:08,747 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 168 transitions. Word has length 37 [2022-03-19 22:01:08,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:01:08,747 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 168 transitions. [2022-03-19 22:01:08,747 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.857142857142857) internal successors, (80), 27 states have internal predecessors, (80), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:01:08,747 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 168 transitions. [2022-03-19 22:01:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-19 22:01:08,748 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:01:08,748 INFO L499 BasicCegarLoop]: trace histogram [2, 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, 1] [2022-03-19 22:01:08,766 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:01:08,964 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:01:08,964 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:01:08,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:01:08,964 INFO L85 PathProgramCache]: Analyzing trace with hash -792280217, now seen corresponding path program 4 times [2022-03-19 22:01:08,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:01:08,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316728095] [2022-03-19 22:01:08,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:01:08,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:01:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:01:09,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:01:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:01:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-19 22:01:09,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:01:09,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316728095] [2022-03-19 22:01:09,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316728095] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:01:09,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537326703] [2022-03-19 22:01:09,009 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-19 22:01:09,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:01:09,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:01:09,010 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:01:09,039 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:01:09,065 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-19 22:01:09,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:01:09,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-19 22:01:09,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:01:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-19 22:01:09,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-19 22:01:09,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537326703] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 22:01:09,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-19 22:01:09,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-03-19 22:01:09,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140495363] [2022-03-19 22:01:09,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 22:01:09,137 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 22:01:09,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:01:09,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 22:01:09,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-19 22:01:09,138 INFO L87 Difference]: Start difference. First operand 134 states and 168 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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:01:09,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:01:09,169 INFO L93 Difference]: Finished difference Result 225 states and 285 transitions. [2022-03-19 22:01:09,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 22:01:09,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 37 [2022-03-19 22:01:09,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:01:09,170 INFO L225 Difference]: With dead ends: 225 [2022-03-19 22:01:09,170 INFO L226 Difference]: Without dead ends: 134 [2022-03-19 22:01:09,170 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-19 22:01:09,170 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 3 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 22:01:09,171 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 75 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 22:01:09,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-03-19 22:01:09,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-03-19 22:01:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 125 states have (on average 1.272) internal successors, (159), 127 states have internal predecessors, (159), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 22:01:09,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 167 transitions. [2022-03-19 22:01:09,182 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 167 transitions. Word has length 37 [2022-03-19 22:01:09,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:01:09,182 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 167 transitions. [2022-03-19 22:01:09,182 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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:01:09,182 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 167 transitions. [2022-03-19 22:01:09,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-19 22:01:09,183 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:01:09,183 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2022-03-19 22:01:09,200 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:01:09,400 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,SelfDestructingSolverStorable12 [2022-03-19 22:01:09,400 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:01:09,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:01:09,400 INFO L85 PathProgramCache]: Analyzing trace with hash -651731607, now seen corresponding path program 1 times [2022-03-19 22:01:09,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:01:09,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876686088] [2022-03-19 22:01:09,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:01:09,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:01:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:01:09,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:01:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:01:09,448 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-19 22:01:09,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:01:09,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876686088] [2022-03-19 22:01:09,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876686088] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 22:01:09,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 22:01:09,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 22:01:09,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376573613] [2022-03-19 22:01:09,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 22:01:09,449 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 22:01:09,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:01:09,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 22:01:09,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-19 22:01:09,449 INFO L87 Difference]: Start difference. First operand 134 states and 167 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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:01:09,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:01:09,546 INFO L93 Difference]: Finished difference Result 208 states and 260 transitions. [2022-03-19 22:01:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-19 22:01:09,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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 37 [2022-03-19 22:01:09,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:01:09,547 INFO L225 Difference]: With dead ends: 208 [2022-03-19 22:01:09,547 INFO L226 Difference]: Without dead ends: 148 [2022-03-19 22:01:09,549 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-19 22:01:09,549 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 61 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 22:01:09,549 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 49 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 22:01:09,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-03-19 22:01:09,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 134. [2022-03-19 22:01:09,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 125 states have (on average 1.264) internal successors, (158), 127 states have internal predecessors, (158), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 22:01:09,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 166 transitions. [2022-03-19 22:01:09,562 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 166 transitions. Word has length 37 [2022-03-19 22:01:09,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:01:09,563 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 166 transitions. [2022-03-19 22:01:09,563 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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:01:09,563 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 166 transitions. [2022-03-19 22:01:09,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-19 22:01:09,563 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:01:09,563 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2022-03-19 22:01:09,563 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-19 22:01:09,563 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:01:09,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:01:09,564 INFO L85 PathProgramCache]: Analyzing trace with hash 524779340, now seen corresponding path program 1 times [2022-03-19 22:01:09,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:01:09,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314451333] [2022-03-19 22:01:09,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:01:09,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:01:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:01:09,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:01:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:01:09,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-19 22:01:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:01:09,772 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-19 22:01:09,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:01:09,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314451333] [2022-03-19 22:01:09,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314451333] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:01:09,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795404358] [2022-03-19 22:01:09,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:01:09,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:01:09,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:01:09,840 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:01:09,846 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:01:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:01:09,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-19 22:01:09,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:01:09,948 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:01:12,094 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 19 treesize of output 7 [2022-03-19 22:01:12,119 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-19 22:01:12,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:01:14,228 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 14 [2022-03-19 22:01:14,231 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 32 treesize of output 28 [2022-03-19 22:01:14,312 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-19 22:01:14,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795404358] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:01:14,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:01:14,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 28 [2022-03-19 22:01:14,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204205302] [2022-03-19 22:01:14,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:01:14,313 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-19 22:01:14,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:01:14,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-19 22:01:14,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=654, Unknown=2, NotChecked=0, Total=756 [2022-03-19 22:01:14,314 INFO L87 Difference]: Start difference. First operand 134 states and 166 transitions. Second operand has 28 states, 26 states have (on average 3.076923076923077) internal successors, (80), 25 states have internal predecessors, (80), 8 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-03-19 22:01:27,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:01:27,396 INFO L93 Difference]: Finished difference Result 306 states and 379 transitions. [2022-03-19 22:01:27,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-19 22:01:27,396 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.076923076923077) internal successors, (80), 25 states have internal predecessors, (80), 8 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 39 [2022-03-19 22:01:27,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:01:27,397 INFO L225 Difference]: With dead ends: 306 [2022-03-19 22:01:27,397 INFO L226 Difference]: Without dead ends: 304 [2022-03-19 22:01:27,398 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=400, Invalid=2562, Unknown=8, NotChecked=0, Total=2970 [2022-03-19 22:01:27,398 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 487 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 425 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-19 22:01:27,399 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [487 Valid, 104 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1038 Invalid, 0 Unknown, 425 Unchecked, 0.5s Time] [2022-03-19 22:01:27,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-03-19 22:01:27,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 142. [2022-03-19 22:01:27,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 131 states have (on average 1.251908396946565) internal successors, (164), 133 states have internal predecessors, (164), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-19 22:01:27,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 174 transitions. [2022-03-19 22:01:27,414 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 174 transitions. Word has length 39 [2022-03-19 22:01:27,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:01:27,414 INFO L478 AbstractCegarLoop]: Abstraction has 142 states and 174 transitions. [2022-03-19 22:01:27,414 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.076923076923077) internal successors, (80), 25 states have internal predecessors, (80), 8 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-03-19 22:01:27,414 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2022-03-19 22:01:27,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-19 22:01:27,415 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:01:27,415 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1] [2022-03-19 22:01:27,439 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:01:27,615 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,SelfDestructingSolverStorable14 [2022-03-19 22:01:27,615 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:01:27,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:01:27,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1213721693, now seen corresponding path program 2 times [2022-03-19 22:01:27,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:01:27,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820236064] [2022-03-19 22:01:27,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:01:27,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:01:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:01:27,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:01:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:01:27,689 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 22:01:27,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:01:27,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820236064] [2022-03-19 22:01:27,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820236064] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:01:27,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953242580] [2022-03-19 22:01:27,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 22:01:27,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:01:27,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:01:27,691 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:01:27,696 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:01:27,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 22:01:27,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:01:27,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-19 22:01:27,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:01:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 22:01:27,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:01:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 22:01:27,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953242580] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:01:27,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:01:27,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-03-19 22:01:27,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374488698] [2022-03-19 22:01:27,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:01:27,947 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-19 22:01:27,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:01:27,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-19 22:01:27,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-03-19 22:01:27,948 INFO L87 Difference]: Start difference. First operand 142 states and 174 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 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:01:28,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:01:28,293 INFO L93 Difference]: Finished difference Result 312 states and 386 transitions. [2022-03-19 22:01:28,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-19 22:01:28,294 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 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 40 [2022-03-19 22:01:28,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:01:28,295 INFO L225 Difference]: With dead ends: 312 [2022-03-19 22:01:28,295 INFO L226 Difference]: Without dead ends: 283 [2022-03-19 22:01:28,296 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2022-03-19 22:01:28,296 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 148 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 22:01:28,296 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 83 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 22:01:28,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-03-19 22:01:28,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 181. [2022-03-19 22:01:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 170 states have (on average 1.276470588235294) internal successors, (217), 172 states have internal predecessors, (217), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-19 22:01:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 227 transitions. [2022-03-19 22:01:28,319 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 227 transitions. Word has length 40 [2022-03-19 22:01:28,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:01:28,319 INFO L478 AbstractCegarLoop]: Abstraction has 181 states and 227 transitions. [2022-03-19 22:01:28,320 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 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:01:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 227 transitions. [2022-03-19 22:01:28,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-19 22:01:28,320 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:01:28,320 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 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:01:28,337 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:01:28,537 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,SelfDestructingSolverStorable15 [2022-03-19 22:01:28,537 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:01:28,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:01:28,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1497733084, now seen corresponding path program 2 times [2022-03-19 22:01:28,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:01:28,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528749443] [2022-03-19 22:01:28,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:01:28,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:01:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:01:29,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:01:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:01:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-19 22:01:29,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:01:29,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528749443] [2022-03-19 22:01:29,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528749443] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:01:29,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069861906] [2022-03-19 22:01:29,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 22:01:29,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:01:29,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:01:29,049 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:01:29,070 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:01:29,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 22:01:29,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:01:29,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-19 22:01:29,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:01:29,156 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 54 treesize of output 50 [2022-03-19 22:01:29,192 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 22 [2022-03-19 22:01:29,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-19 22:01:29,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-03-19 22:01:29,394 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-03-19 22:01:29,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-03-19 22:01:29,493 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-03-19 22:01:29,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-03-19 22:01:29,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-03-19 22:01:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-19 22:01:29,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:01:34,858 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 22:01:34,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069861906] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:01:34,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:01:34,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 16] total 39 [2022-03-19 22:01:34,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707189006] [2022-03-19 22:01:34,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:01:34,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-19 22:01:34,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:01:34,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-19 22:01:34,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1266, Unknown=4, NotChecked=0, Total=1482 [2022-03-19 22:01:34,860 INFO L87 Difference]: Start difference. First operand 181 states and 227 transitions. Second operand has 39 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 36 states have internal predecessors, (93), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:01:35,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:01:35,916 INFO L93 Difference]: Finished difference Result 408 states and 515 transitions. [2022-03-19 22:01:35,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-19 22:01:35,917 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 36 states have internal predecessors, (93), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-03-19 22:01:35,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:01:35,918 INFO L225 Difference]: With dead ends: 408 [2022-03-19 22:01:35,918 INFO L226 Difference]: Without dead ends: 406 [2022-03-19 22:01:35,919 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=640, Invalid=2778, Unknown=4, NotChecked=0, Total=3422 [2022-03-19 22:01:35,920 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 342 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 586 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-19 22:01:35,920 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 117 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 900 Invalid, 0 Unknown, 586 Unchecked, 0.5s Time] [2022-03-19 22:01:35,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-03-19 22:01:35,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 277. [2022-03-19 22:01:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 266 states have (on average 1.3233082706766917) internal successors, (352), 268 states have internal predecessors, (352), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-19 22:01:35,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 362 transitions. [2022-03-19 22:01:35,948 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 362 transitions. Word has length 40 [2022-03-19 22:01:35,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:01:35,948 INFO L478 AbstractCegarLoop]: Abstraction has 277 states and 362 transitions. [2022-03-19 22:01:35,948 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 36 states have internal predecessors, (93), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:01:35,948 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 362 transitions. [2022-03-19 22:01:35,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-19 22:01:35,949 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:01:35,949 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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:01:35,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-03-19 22:01:36,154 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,SelfDestructingSolverStorable16 [2022-03-19 22:01:36,154 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:01:36,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:01:36,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1769101657, now seen corresponding path program 3 times [2022-03-19 22:01:36,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:01:36,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800255961] [2022-03-19 22:01:36,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:01:36,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:01:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:01:36,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:01:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:01:36,784 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-19 22:01:36,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:01:36,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800255961] [2022-03-19 22:01:36,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800255961] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:01:36,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986673979] [2022-03-19 22:01:36,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-19 22:01:36,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:01:36,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:01:36,787 INFO L229 MonitoredProcess]: Starting monitored process 15 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:01:36,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-19 22:01:36,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-19 22:01:36,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:01:36,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-19 22:01:36,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:01:36,962 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 18 treesize of output 16 [2022-03-19 22:01:37,046 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-19 22:01:37,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-19 22:01:37,049 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-19 22:01:37,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 42 [2022-03-19 22:01:37,293 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-19 22:01:37,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-19 22:01:37,307 INFO L356 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2022-03-19 22:01:37,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 59 [2022-03-19 22:01:37,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-19 22:01:37,642 INFO L356 Elim1Store]: treesize reduction 238, result has 26.8 percent of original size [2022-03-19 22:01:37,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 4 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 23 case distinctions, treesize of input 88 treesize of output 159 [2022-03-19 22:01:51,619 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-19 22:01:51,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 29 [2022-03-19 22:01:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-19 22:01:51,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:01:53,325 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_640 Int) (main_~j~0 Int) (v_ArrVal_639 Int) (v_main_~x~0_39 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* 4 c_main_~x~0) |c_main_~#distance~0.offset|) v_ArrVal_639)) (.cse1 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|))) (or (not (<= 0 (+ v_ArrVal_639 1))) (<= (select .cse0 .cse1) (let ((.cse2 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0)) (.cse3 (* main_~j~0 4))) (+ (select (select .cse2 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse3)) (select .cse0 (+ (* (select (select .cse2 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse3)) 4) |c_main_~#distance~0.offset|))))) (<= 3 main_~j~0) (<= main_~j~0 1) (<= 0 (select (store .cse0 .cse1 v_ArrVal_640) |c_main_~#distance~0.offset|))))) is different from false [2022-03-19 22:01:54,260 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_639)) (.cse1 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|))) (or (<= (select .cse0 .cse1) (let ((.cse2 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0)) (.cse3 (* v_main_~j~0_53 4))) (+ (select .cse0 (+ (* (select (select .cse2 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse3)) 4) |c_main_~#distance~0.offset|)) (select (select .cse2 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse3))))) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= 0 (select (store .cse0 .cse1 v_ArrVal_640) |c_main_~#distance~0.offset|)) (<= 3 v_main_~j~0_53)))) is different from false [2022-03-19 22:01:55,190 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (let ((.cse1 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|)) (.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 4)) v_ArrVal_639))) (or (<= 0 (select (store .cse0 .cse1 v_ArrVal_640) |c_main_~#distance~0.offset|)) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= (select .cse0 .cse1) (let ((.cse2 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0)) (.cse3 (* v_main_~j~0_53 4))) (+ (select (select .cse2 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse3)) (select .cse0 (+ (* (select (select .cse2 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse3)) 4) |c_main_~#distance~0.offset|))))) (<= 3 v_main_~j~0_53)))) is different from false [2022-03-19 22:01:59,831 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2022-03-19 22:01:59,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986673979] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:01:59,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:01:59,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 21] total 55 [2022-03-19 22:01:59,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039914381] [2022-03-19 22:01:59,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:01:59,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-03-19 22:01:59,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:01:59,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-03-19 22:01:59,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=2252, Unknown=12, NotChecked=306, Total=2970 [2022-03-19 22:01:59,833 INFO L87 Difference]: Start difference. First operand 277 states and 362 transitions. Second operand has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 states have internal predecessors, (101), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:02:00,745 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|)) (.cse1 (select |c_#memory_int| |c_main_~#distance~0.base|))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#Source~0.offset| 0) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (= (select .cse0 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Weight~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= (select .cse1 |c_main_~#distance~0.offset|) 0) (forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (let ((.cse3 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|)) (.cse2 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 4)) v_ArrVal_639))) (or (<= 0 (select (store .cse2 .cse3 v_ArrVal_640) |c_main_~#distance~0.offset|)) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= (select .cse2 .cse3) (let ((.cse4 (store |c_#memory_int| |c_main_~#distance~0.base| .cse2)) (.cse5 (* v_main_~j~0_53 4))) (+ (select (select .cse4 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse5)) (select .cse2 (+ (* (select (select .cse4 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse5)) 4) |c_main_~#distance~0.offset|))))) (<= 3 v_main_~j~0_53)))) (= c_main_~i~0 0) (= (select .cse1 (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|)) 0) (not (= |c_main_~#distance~0.base| |c_main_~#Source~0.base|)) (= |c_main_~#Weight~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| 8)) 1) (<= 2 (select (select |c_#memory_int| |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| 8))) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-03-19 22:02:01,516 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|)) (.cse1 (select |c_#memory_int| |c_main_~#distance~0.base|))) (and (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#Source~0.offset| 0) (= |c_main_~#distance~0.offset| 0) (= (select .cse0 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Weight~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= (select .cse1 |c_main_~#distance~0.offset|) 0) (= (select .cse1 0) 0) (forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (let ((.cse3 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|)) (.cse2 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 4)) v_ArrVal_639))) (or (<= 0 (select (store .cse2 .cse3 v_ArrVal_640) |c_main_~#distance~0.offset|)) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= (select .cse2 .cse3) (let ((.cse4 (store |c_#memory_int| |c_main_~#distance~0.base| .cse2)) (.cse5 (* v_main_~j~0_53 4))) (+ (select (select .cse4 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse5)) (select .cse2 (+ (* (select (select .cse4 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse5)) 4) |c_main_~#distance~0.offset|))))) (<= 3 v_main_~j~0_53)))) (not (= |c_main_~#distance~0.base| |c_main_~#Source~0.base|)) (= |c_main_~#Weight~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| 8)) 1) (<= 2 (select (select |c_#memory_int| |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| 8))))) is different from false [2022-03-19 22:02:02,294 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_main_~#distance~0.base|)) (.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|)) (.cse1 (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|))) (and (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#Source~0.offset| 0) (= .cse1 0) (= |c_main_~#distance~0.offset| 0) (= (select .cse0 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Weight~0.base|)) (= |c_main_~#Dest~0.offset| 0) (forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_639)) (.cse3 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|))) (or (<= (select .cse2 .cse3) (let ((.cse4 (store |c_#memory_int| |c_main_~#distance~0.base| .cse2)) (.cse5 (* v_main_~j~0_53 4))) (+ (select .cse2 (+ (* (select (select .cse4 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse5)) 4) |c_main_~#distance~0.offset|)) (select (select .cse4 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse5))))) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= 0 (select (store .cse2 .cse3 v_ArrVal_640) |c_main_~#distance~0.offset|)) (<= 3 v_main_~j~0_53)))) (= (select .cse6 |c_main_~#distance~0.offset|) 0) (= (select .cse6 0) 0) (= (select .cse0 .cse1) 1) (not (= |c_main_~#distance~0.base| |c_main_~#Source~0.base|)) (= |c_main_~#Weight~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| 8)) 1) (<= 2 (select (select |c_#memory_int| |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| 8))) (= c_main_~j~0 0))) is different from false [2022-03-19 22:02:03,068 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (let ((.cse0 (select .cse1 |c_main_~#Dest~0.offset|)) (.cse2 (select |c_#memory_int| |c_main_~#distance~0.base|))) (and (= .cse0 1) (= |c_main_~#Source~0.offset| 0) (= (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|) 0) (= |c_main_~#distance~0.offset| 0) (= .cse0 c_main_~x~0) (= (select .cse1 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (not (= |c_main_~#distance~0.base| |c_main_~#Weight~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= (select .cse2 |c_main_~#distance~0.offset|) 0) (= (select .cse2 0) 0) (not (= |c_main_~#distance~0.base| |c_main_~#Source~0.base|)) (forall ((v_ArrVal_640 Int) (main_~j~0 Int) (v_ArrVal_639 Int) (v_main_~x~0_39 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* 4 c_main_~x~0) |c_main_~#distance~0.offset|) v_ArrVal_639)) (.cse4 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|))) (or (not (<= 0 (+ v_ArrVal_639 1))) (<= (select .cse3 .cse4) (let ((.cse5 (store |c_#memory_int| |c_main_~#distance~0.base| .cse3)) (.cse6 (* main_~j~0 4))) (+ (select (select .cse5 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse6)) (select .cse3 (+ (* (select (select .cse5 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse6)) 4) |c_main_~#distance~0.offset|))))) (<= 3 main_~j~0) (<= main_~j~0 1) (<= 0 (select (store .cse3 .cse4 v_ArrVal_640) |c_main_~#distance~0.offset|))))) (= |c_main_~#Weight~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| 8)) 1) (<= 2 (select (select |c_#memory_int| |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| 8))) (= (+ (- 1) c_main_~x~0) 0) (= c_main_~j~0 0)))) is different from false [2022-03-19 22:02:06,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:02:06,602 INFO L93 Difference]: Finished difference Result 388 states and 495 transitions. [2022-03-19 22:02:06,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-03-19 22:02:06,602 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 states have internal predecessors, (101), 3 states have call successors, (5), 4 states have call predecessors, (5), 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:02:06,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:02:06,604 INFO L225 Difference]: With dead ends: 388 [2022-03-19 22:02:06,604 INFO L226 Difference]: Without dead ends: 360 [2022-03-19 22:02:06,606 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 110 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2765 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=1598, Invalid=9334, Unknown=16, NotChecked=1484, Total=12432 [2022-03-19 22:02:06,606 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 190 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 2337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1383 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-19 22:02:06,606 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 156 Invalid, 2337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 856 Invalid, 0 Unknown, 1383 Unchecked, 0.4s Time] [2022-03-19 22:02:06,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-03-19 22:02:06,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 294. [2022-03-19 22:02:06,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 283 states have (on average 1.3180212014134276) internal successors, (373), 285 states have internal predecessors, (373), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-19 22:02:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 383 transitions. [2022-03-19 22:02:06,639 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 383 transitions. Word has length 43 [2022-03-19 22:02:06,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:02:06,639 INFO L478 AbstractCegarLoop]: Abstraction has 294 states and 383 transitions. [2022-03-19 22:02:06,640 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 states have internal predecessors, (101), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:02:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 383 transitions. [2022-03-19 22:02:06,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-19 22:02:06,640 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:02:06,640 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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:02:06,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-03-19 22:02:06,849 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:02:06,850 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:02:06,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:02:06,850 INFO L85 PathProgramCache]: Analyzing trace with hash 2016392549, now seen corresponding path program 4 times [2022-03-19 22:02:06,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:02:06,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881228582] [2022-03-19 22:02:06,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:02:06,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:02:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:02:07,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:02:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:02:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-19 22:02:07,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:02:07,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881228582] [2022-03-19 22:02:07,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881228582] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:02:07,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628482806] [2022-03-19 22:02:07,215 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-19 22:02:07,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:02:07,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:02:07,228 INFO L229 MonitoredProcess]: Starting monitored process 16 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:02:07,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-19 22:02:07,351 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-19 22:02:07,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:02:07,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-19 22:02:07,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:02:07,369 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 54 treesize of output 50 [2022-03-19 22:02:07,420 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 24 [2022-03-19 22:02:07,827 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-03-19 22:02:07,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2022-03-19 22:02:23,113 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-03-19 22:02:23,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 13 [2022-03-19 22:02:23,173 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-19 22:02:23,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:02:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-19 22:02:38,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628482806] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:02:38,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:02:38,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 19] total 46 [2022-03-19 22:02:38,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149296514] [2022-03-19 22:02:38,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:02:38,805 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-19 22:02:38,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:02:38,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-19 22:02:38,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1781, Unknown=19, NotChecked=0, Total=2070 [2022-03-19 22:02:38,806 INFO L87 Difference]: Start difference. First operand 294 states and 383 transitions. Second operand has 46 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:02:47,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:02:47,590 INFO L93 Difference]: Finished difference Result 323 states and 414 transitions. [2022-03-19 22:02:47,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-19 22:02:47,591 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 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:02:47,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:02:47,592 INFO L225 Difference]: With dead ends: 323 [2022-03-19 22:02:47,592 INFO L226 Difference]: Without dead ends: 301 [2022-03-19 22:02:47,593 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 48 SyntacticMatches, 15 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1462 ImplicationChecksByTransitivity, 38.9s TimeCoverageRelationStatistics Valid=657, Invalid=3742, Unknown=23, NotChecked=0, Total=4422 [2022-03-19 22:02:47,594 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 83 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 496 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 22:02:47,594 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 152 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 318 Invalid, 0 Unknown, 496 Unchecked, 0.1s Time] [2022-03-19 22:02:47,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-03-19 22:02:47,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2022-03-19 22:02:47,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 286 states have (on average 1.3181818181818181) internal successors, (377), 288 states have internal predecessors, (377), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-19 22:02:47,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 387 transitions. [2022-03-19 22:02:47,627 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 387 transitions. Word has length 43 [2022-03-19 22:02:47,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:02:47,627 INFO L478 AbstractCegarLoop]: Abstraction has 297 states and 387 transitions. [2022-03-19 22:02:47,627 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:02:47,627 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 387 transitions. [2022-03-19 22:02:47,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-03-19 22:02:47,628 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:02:47,628 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:02:47,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-19 22:02:47,845 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:02:47,846 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:02:47,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:02:47,846 INFO L85 PathProgramCache]: Analyzing trace with hash 651363238, now seen corresponding path program 2 times [2022-03-19 22:02:47,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:02:47,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679441889] [2022-03-19 22:02:47,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:02:47,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:02:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:02:47,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:02:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:02:47,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-19 22:02:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:02:47,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-03-19 22:02:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:02:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-19 22:02:47,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:02:47,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679441889] [2022-03-19 22:02:47,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679441889] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:02:47,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862473089] [2022-03-19 22:02:47,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 22:02:47,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:02:47,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:02:47,931 INFO L229 MonitoredProcess]: Starting monitored process 17 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:02:47,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-19 22:02:48,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 22:02:48,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:02:48,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-19 22:02:48,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:02:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-19 22:02:48,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:02:48,236 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-19 22:02:48,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862473089] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:02:48,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:02:48,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-03-19 22:02:48,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340297787] [2022-03-19 22:02:48,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:02:48,242 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-19 22:02:48,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:02:48,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-19 22:02:48,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-03-19 22:02:48,263 INFO L87 Difference]: Start difference. First operand 297 states and 387 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-19 22:02:48,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:02:48,703 INFO L93 Difference]: Finished difference Result 881 states and 1162 transitions. [2022-03-19 22:02:48,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-19 22:02:48,703 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-03-19 22:02:48,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:02:48,707 INFO L225 Difference]: With dead ends: 881 [2022-03-19 22:02:48,707 INFO L226 Difference]: Without dead ends: 697 [2022-03-19 22:02:48,708 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2022-03-19 22:02:48,709 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 298 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 22:02:48,709 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 66 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 22:02:48,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2022-03-19 22:02:48,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 510. [2022-03-19 22:02:48,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 497 states have (on average 1.336016096579477) internal successors, (664), 500 states have internal predecessors, (664), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-19 22:02:48,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 678 transitions. [2022-03-19 22:02:48,773 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 678 transitions. Word has length 47 [2022-03-19 22:02:48,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:02:48,773 INFO L478 AbstractCegarLoop]: Abstraction has 510 states and 678 transitions. [2022-03-19 22:02:48,773 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-19 22:02:48,773 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 678 transitions. [2022-03-19 22:02:48,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-19 22:02:48,775 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:02:48,775 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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:02:48,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-19 22:02:48,991 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:02:48,991 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:02:48,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:02:48,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1904691350, now seen corresponding path program 5 times [2022-03-19 22:02:48,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:02:48,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110740511] [2022-03-19 22:02:48,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:02:48,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:02:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:02:49,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:02:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:02:49,115 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 22:02:49,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:02:49,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110740511] [2022-03-19 22:02:49,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110740511] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:02:49,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099618234] [2022-03-19 22:02:49,115 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-19 22:02:49,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:02:49,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:02:49,132 INFO L229 MonitoredProcess]: Starting monitored process 18 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:02:49,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-19 22:02:49,475 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-19 22:02:49,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:02:49,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-19 22:02:49,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:02:49,584 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 22:02:49,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:02:49,648 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 22:02:49,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099618234] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:02:49,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:02:49,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-03-19 22:02:49,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672075143] [2022-03-19 22:02:49,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:02:49,649 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-19 22:02:49,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:02:49,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-19 22:02:49,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-03-19 22:02:49,649 INFO L87 Difference]: Start difference. First operand 510 states and 678 transitions. Second operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 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:02:50,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:02:50,203 INFO L93 Difference]: Finished difference Result 1169 states and 1532 transitions. [2022-03-19 22:02:50,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-19 22:02:50,203 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 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 46 [2022-03-19 22:02:50,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:02:50,206 INFO L225 Difference]: With dead ends: 1169 [2022-03-19 22:02:50,206 INFO L226 Difference]: Without dead ends: 1131 [2022-03-19 22:02:50,207 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=292, Invalid=898, Unknown=0, NotChecked=0, Total=1190 [2022-03-19 22:02:50,208 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 195 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-19 22:02:50,208 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 93 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-19 22:02:50,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2022-03-19 22:02:50,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 679. [2022-03-19 22:02:50,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 666 states have (on average 1.3693693693693694) internal successors, (912), 669 states have internal predecessors, (912), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-19 22:02:50,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 926 transitions. [2022-03-19 22:02:50,300 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 926 transitions. Word has length 46 [2022-03-19 22:02:50,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:02:50,300 INFO L478 AbstractCegarLoop]: Abstraction has 679 states and 926 transitions. [2022-03-19 22:02:50,300 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 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:02:50,300 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 926 transitions. [2022-03-19 22:02:50,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-19 22:02:50,301 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:02:50,302 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 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] [2022-03-19 22:02:50,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-03-19 22:02:50,508 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:02:50,509 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:02:50,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:02:50,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1776596685, now seen corresponding path program 3 times [2022-03-19 22:02:50,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:02:50,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435973916] [2022-03-19 22:02:50,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:02:50,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:02:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:02:50,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:02:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:02:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-19 22:02:50,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:02:50,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435973916] [2022-03-19 22:02:50,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435973916] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:02:50,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406074760] [2022-03-19 22:02:50,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-19 22:02:50,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:02:50,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:02:50,564 INFO L229 MonitoredProcess]: Starting monitored process 19 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:02:50,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-19 22:02:50,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-19 22:02:50,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:02:50,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 61 conjunts are in the unsatisfiable core [2022-03-19 22:02:50,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:02:50,728 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 18 treesize of output 16 [2022-03-19 22:02:50,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-19 22:02:50,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-19 22:02:50,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-19 22:02:50,805 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-03-19 22:02:50,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 66 [2022-03-19 22:02:50,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-19 22:02:50,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-19 22:02:50,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-19 22:02:50,981 INFO L356 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2022-03-19 22:02:50,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 74 [2022-03-19 22:02:51,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-19 22:02:51,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-19 22:02:51,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-19 22:02:51,247 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-03-19 22:02:51,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 66 treesize of output 79 [2022-03-19 22:02:51,571 INFO L356 Elim1Store]: treesize reduction 160, result has 44.3 percent of original size [2022-03-19 22:02:51,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 6 disjoint index pairs (out of 66 index pairs), introduced 15 new quantified variables, introduced 32 case distinctions, treesize of input 103 treesize of output 180 [2022-03-19 22:02:55,641 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 22:02:55,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:04:16,944 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 22:04:16,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406074760] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:04:16,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:04:16,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19, 19] total 39 [2022-03-19 22:04:16,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820056539] [2022-03-19 22:04:16,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:04:16,945 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-19 22:04:16,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:04:16,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-19 22:04:16,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1299, Unknown=35, NotChecked=0, Total=1482 [2022-03-19 22:04:16,949 INFO L87 Difference]: Start difference. First operand 679 states and 926 transitions. Second operand has 39 states, 39 states have (on average 2.58974358974359) internal successors, (101), 38 states have internal predecessors, (101), 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:07:22,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:07:22,814 INFO L93 Difference]: Finished difference Result 2134 states and 2782 transitions. [2022-03-19 22:07:22,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2022-03-19 22:07:22,814 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.58974358974359) internal successors, (101), 38 states have internal predecessors, (101), 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 46 [2022-03-19 22:07:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:07:22,819 INFO L225 Difference]: With dead ends: 2134 [2022-03-19 22:07:22,819 INFO L226 Difference]: Without dead ends: 1607 [2022-03-19 22:07:22,822 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 67 SyntacticMatches, 7 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10006 ImplicationChecksByTransitivity, 265.6s TimeCoverageRelationStatistics Valid=3194, Invalid=24738, Unknown=124, NotChecked=0, Total=28056 [2022-03-19 22:07:22,823 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 718 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 2196 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 3942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 2196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1216 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-19 22:07:22,823 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [718 Valid, 161 Invalid, 3942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 2196 Invalid, 0 Unknown, 1216 Unchecked, 1.3s Time] [2022-03-19 22:07:22,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2022-03-19 22:07:22,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 735. [2022-03-19 22:07:22,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 722 states have (on average 1.3060941828254848) internal successors, (943), 725 states have internal predecessors, (943), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-19 22:07:22,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 957 transitions. [2022-03-19 22:07:22,984 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 957 transitions. Word has length 46 [2022-03-19 22:07:22,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:07:22,985 INFO L478 AbstractCegarLoop]: Abstraction has 735 states and 957 transitions. [2022-03-19 22:07:22,985 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.58974358974359) internal successors, (101), 38 states have internal predecessors, (101), 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:07:22,985 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 957 transitions. [2022-03-19 22:07:22,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-19 22:07:22,986 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:07:22,986 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 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] [2022-03-19 22:07:23,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-19 22:07:23,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:07:23,203 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:07:23,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:07:23,204 INFO L85 PathProgramCache]: Analyzing trace with hash 488480228, now seen corresponding path program 4 times [2022-03-19 22:07:23,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:07:23,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833505890] [2022-03-19 22:07:23,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:07:23,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:07:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:23,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:07:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:07:23,274 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-19 22:07:23,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:07:23,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833505890] [2022-03-19 22:07:23,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833505890] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:07:23,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616520920] [2022-03-19 22:07:23,274 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-19 22:07:23,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:07:23,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:07:23,276 INFO L229 MonitoredProcess]: Starting monitored process 20 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:07:23,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-19 22:07:23,389 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-19 22:07:23,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:07:23,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-19 22:07:23,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:07:23,510 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-19 22:07:23,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:07:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-19 22:07:23,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616520920] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:07:23,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:07:23,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 18 [2022-03-19 22:07:23,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481113420] [2022-03-19 22:07:23,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:07:23,605 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-19 22:07:23,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:07:23,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-19 22:07:23,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-03-19 22:07:23,605 INFO L87 Difference]: Start difference. First operand 735 states and 957 transitions. Second operand has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 17 states have internal predecessors, (78), 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:07:24,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:07:24,456 INFO L93 Difference]: Finished difference Result 1338 states and 1689 transitions. [2022-03-19 22:07:24,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-19 22:07:24,457 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 17 states have internal predecessors, (78), 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 46 [2022-03-19 22:07:24,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:07:24,460 INFO L225 Difference]: With dead ends: 1338 [2022-03-19 22:07:24,460 INFO L226 Difference]: Without dead ends: 1217 [2022-03-19 22:07:24,460 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2022-03-19 22:07:24,461 INFO L913 BasicCegarLoop]: 101 mSDtfsCounter, 292 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-19 22:07:24,461 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 138 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-19 22:07:24,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2022-03-19 22:07:24,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 805. [2022-03-19 22:07:24,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 792 states have (on average 1.2992424242424243) internal successors, (1029), 795 states have internal predecessors, (1029), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-19 22:07:24,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1043 transitions. [2022-03-19 22:07:24,582 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1043 transitions. Word has length 46 [2022-03-19 22:07:24,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:07:24,582 INFO L478 AbstractCegarLoop]: Abstraction has 805 states and 1043 transitions. [2022-03-19 22:07:24,582 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 17 states have internal predecessors, (78), 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:07:24,583 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1043 transitions. [2022-03-19 22:07:24,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-03-19 22:07:24,584 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:07:24,584 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2022-03-19 22:07:24,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-19 22:07:24,797 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:07:24,798 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:07:24,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:07:24,798 INFO L85 PathProgramCache]: Analyzing trace with hash 849261116, now seen corresponding path program 1 times [2022-03-19 22:07:24,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:07:24,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290947433] [2022-03-19 22:07:24,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:07:24,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:07:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-19 22:07:24,835 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-19 22:07:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-19 22:07:24,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-19 22:07:24,881 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-03-19 22:07:24,882 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-19 22:07:24,884 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-19 22:07:24,888 INFO L719 BasicCegarLoop]: Path program histogram: [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:07:24,890 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-19 22:07:24,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.03 10:07:24 BoogieIcfgContainer [2022-03-19 22:07:24,942 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-19 22:07:24,943 INFO L158 Benchmark]: Toolchain (without parser) took 461864.39ms. Allocated memory was 162.5MB in the beginning and 251.7MB in the end (delta: 89.1MB). Free memory was 111.4MB in the beginning and 74.0MB in the end (delta: 37.4MB). Peak memory consumption was 127.0MB. Max. memory is 8.0GB. [2022-03-19 22:07:24,943 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 162.5MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-19 22:07:24,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.78ms. Allocated memory is still 162.5MB. Free memory was 111.2MB in the beginning and 136.1MB in the end (delta: -24.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-19 22:07:24,943 INFO L158 Benchmark]: Boogie Preprocessor took 30.02ms. Allocated memory is still 162.5MB. Free memory was 136.1MB in the beginning and 134.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-19 22:07:24,943 INFO L158 Benchmark]: RCFGBuilder took 341.20ms. Allocated memory is still 162.5MB. Free memory was 134.1MB in the beginning and 118.4MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-03-19 22:07:24,943 INFO L158 Benchmark]: TraceAbstraction took 461266.55ms. Allocated memory was 162.5MB in the beginning and 251.7MB in the end (delta: 89.1MB). Free memory was 118.1MB in the beginning and 74.0MB in the end (delta: 44.1MB). Peak memory consumption was 134.8MB. Max. memory is 8.0GB. [2022-03-19 22:07:24,945 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 162.5MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 222.78ms. Allocated memory is still 162.5MB. Free memory was 111.2MB in the beginning and 136.1MB in the end (delta: -24.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.02ms. Allocated memory is still 162.5MB. Free memory was 136.1MB in the beginning and 134.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 341.20ms. Allocated memory is still 162.5MB. Free memory was 134.1MB in the beginning and 118.4MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 461266.55ms. Allocated memory was 162.5MB in the beginning and 251.7MB in the end (delta: 89.1MB). Free memory was 118.1MB in the beginning and 74.0MB in the end (delta: 44.1MB). Peak memory consumption was 134.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int INFINITY = 899; VAL [\old(INFINITY)=901, INFINITY=899] [L18] int nodecount = __VERIFIER_nondet_int(); [L19] int edgecount = __VERIFIER_nondet_int(); [L20] COND FALSE !(!(0 <= nodecount && nodecount <= 4)) VAL [edgecount=1, INFINITY=899, nodecount=2] [L21] COND FALSE !(!(0 <= edgecount && edgecount <= 19)) [L22] int source = 0; [L23] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L24] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L25] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L26] int distance[5]; [L27] int x,y; [L28] int i,j; [L30] i = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, Source={22:0}, source=0, Weight={25:0}] [L30] COND TRUE i < nodecount VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, Source={22:0}, source=0, Weight={25:0}] [L31] COND TRUE i == source [L32] distance[i] = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={22:0}, Weight={25:0}] [L30] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, source=0, Source={22:0}, Weight={25:0}] [L30] COND TRUE i < nodecount VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, Source={22:0}, source=0, Weight={25:0}] [L31] COND FALSE !(i == source) [L35] distance[i] = INFINITY VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, source=0, Source={22:0}, Weight={25:0}] [L30] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=2, INFINITY=899, nodecount=2, source=0, Source={22:0}, Weight={25:0}] [L30] COND FALSE !(i < nodecount) VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=2, INFINITY=899, nodecount=2, Source={22:0}, source=0, Weight={25:0}] [L39] i = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, Source={22:0}, source=0, Weight={25:0}] [L39] COND TRUE i < nodecount [L41] j = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, Source={22:0}, source=0, Weight={25:0}] [L41] COND TRUE j < edgecount [L43] EXPR Dest[j] [L43] x = Dest[j] [L44] EXPR Source[j] [L44] y = Source[j] [L45] EXPR distance[x] [L45] EXPR distance[y] [L45] EXPR Weight[j] VAL [Dest={23:0}, distance={21:0}, distance[x]=899, distance[y]=0, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, Source={22:0}, source=0, Weight={25:0}, Weight[j]=0, x=1, y=0] [L45] COND TRUE distance[x] > distance[y] + Weight[j] [L47] distance[x] = -1 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L41] j++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L41] COND FALSE !(j < edgecount) VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L39] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L39] COND TRUE i < nodecount [L41] j = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=0, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L41] COND TRUE j < edgecount [L43] EXPR Dest[j] [L43] x = Dest[j] [L44] EXPR Source[j] [L44] y = Source[j] [L45] EXPR distance[x] [L45] EXPR distance[y] [L45] EXPR Weight[j] VAL [Dest={23:0}, distance={21:0}, distance[x]=-1, distance[y]=0, edgecount=1, i=1, INFINITY=899, j=0, nodecount=2, source=0, Source={22:0}, Weight={25:0}, Weight[j]=0, x=1, y=0] [L45] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L41] j++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L41] COND FALSE !(j < edgecount) VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L39] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=2, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L39] COND FALSE !(i < nodecount) VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=2, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L51] i = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L51] COND TRUE i < edgecount [L53] EXPR Dest[i] [L53] x = Dest[i] [L54] EXPR Source[i] [L54] y = Source[i] [L55] EXPR distance[x] [L55] EXPR distance[y] [L55] EXPR Weight[i] VAL [Dest={23:0}, distance={21:0}, distance[x]=-1, distance[y]=0, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, Weight[i]=0, x=1, y=0] [L55] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L51] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L51] COND FALSE !(i < edgecount) VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L61] i = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L61] COND TRUE i < nodecount [L63] EXPR distance[i] VAL [Dest={23:0}, distance={21:0}, distance[i]=0, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L63] CALL __VERIFIER_assert(distance[i]>=0) VAL [\old(cond)=1, INFINITY=899] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, INFINITY=899] [L63] RET __VERIFIER_assert(distance[i]>=0) VAL [Dest={23:0}, distance={21:0}, distance[i]=0, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L61] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L61] COND TRUE i < nodecount [L63] EXPR distance[i] VAL [Dest={23:0}, distance={21:0}, distance[i]=-1, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L63] CALL __VERIFIER_assert(distance[i]>=0) VAL [\old(cond)=0, INFINITY=899] [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, INFINITY=899] [L12] reach_error() VAL [\old(cond)=0, cond=0, INFINITY=899] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 461.2s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 235.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4075 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4062 mSDsluCounter, 2377 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 5095 IncrementalHoareTripleChecker+Unchecked, 1367 mSDsCounter, 1901 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11210 IncrementalHoareTripleChecker+Invalid, 18206 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1901 mSolverCounterUnsat, 1010 mSDtfsCounter, 11210 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2114 GetRequests, 1195 SyntacticMatches, 56 SemanticMatches, 863 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 19028 ImplicationChecksByTransitivity, 420.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=805occurred in iteration=23, InterpolantAutomatonStates: 497, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 2792 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 217.7s InterpolantComputationTime, 1570 NumberOfCodeBlocks, 1561 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 2136 ConstructedInterpolants, 198 QuantifiedInterpolants, 24543 SizeOfPredicates, 190 NumberOfNonLiveVariables, 5985 ConjunctsInSsa, 401 ConjunctsInUnsatCore, 60 InterpolantComputations, 5 PerfectInterpolantSequences, 363/920 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-03-19 22:07:25,177 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-03-19 22:07:25,226 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 137 Received shutdown request...