/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops/eureka_01-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 03:18:42,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 03:18:42,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 03:18:42,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 03:18:42,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 03:18:42,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 03:18:42,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 03:18:42,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 03:18:42,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 03:18:42,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 03:18:42,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 03:18:42,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 03:18:42,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 03:18:42,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 03:18:42,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 03:18:42,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 03:18:42,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 03:18:42,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 03:18:42,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 03:18:42,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 03:18:42,188 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 03:18:42,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 03:18:42,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 03:18:42,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 03:18:42,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 03:18:42,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 03:18:42,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 03:18:42,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 03:18:42,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 03:18:42,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 03:18:42,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 03:18:42,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 03:18:42,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 03:18:42,194 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 03:18:42,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 03:18:42,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 03:18:42,196 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 03:18:42,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 03:18:42,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 03:18:42,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 03:18:42,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 03:18:42,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 03:18:42,198 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-20 03:18:42,204 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 03:18:42,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 03:18:42,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 03:18:42,205 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 03:18:42,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 03:18:42,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 03:18:42,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 03:18:42,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 03:18:42,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 03:18:42,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 03:18:42,206 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 03:18:42,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 03:18:42,206 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 03:18:42,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 03:18:42,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 03:18:42,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 03:18:42,206 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 03:18:42,206 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 03:18:42,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 03:18:42,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 03:18:42,207 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 03:18:42,207 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-20 03:18:42,207 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-20 03:18:42,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 03:18:42,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 03:18:42,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 03:18:42,394 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 03:18:42,395 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 03:18:42,396 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-20 03:18:42,465 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256247777/2e218ecd075b495a9dffd74b0d836e0c/FLAGdf9f0f442 [2022-03-20 03:18:42,836 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 03:18:42,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-1.c [2022-03-20 03:18:42,842 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256247777/2e218ecd075b495a9dffd74b0d836e0c/FLAGdf9f0f442 [2022-03-20 03:18:42,858 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256247777/2e218ecd075b495a9dffd74b0d836e0c [2022-03-20 03:18:42,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 03:18:42,862 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-20 03:18:42,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 03:18:42,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 03:18:42,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 03:18:42,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 03:18:42" (1/1) ... [2022-03-20 03:18:42,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e5ad3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:18:42, skipping insertion in model container [2022-03-20 03:18:42,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 03:18:42" (1/1) ... [2022-03-20 03:18:42,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 03:18:42,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 03:18:43,030 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-20 03:18:43,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 03:18:43,091 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 03:18:43,103 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-20 03:18:43,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 03:18:43,152 INFO L208 MainTranslator]: Completed translation [2022-03-20 03:18:43,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:18:43 WrapperNode [2022-03-20 03:18:43,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 03:18:43,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 03:18:43,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 03:18:43,176 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 03:18:43,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:18:43" (1/1) ... [2022-03-20 03:18:43,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:18:43" (1/1) ... [2022-03-20 03:18:43,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:18:43" (1/1) ... [2022-03-20 03:18:43,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:18:43" (1/1) ... [2022-03-20 03:18:43,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:18:43" (1/1) ... [2022-03-20 03:18:43,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:18:43" (1/1) ... [2022-03-20 03:18:43,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:18:43" (1/1) ... [2022-03-20 03:18:43,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 03:18:43,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 03:18:43,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 03:18:43,205 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 03:18:43,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:18:43" (1/1) ... [2022-03-20 03:18:43,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 03:18:43,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:18:43,239 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-20 03:18:43,250 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-20 03:18:43,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 03:18:43,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 03:18:43,271 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-20 03:18:43,271 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 03:18:43,272 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 03:18:43,272 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 03:18:43,272 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 03:18:43,272 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-20 03:18:43,273 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 03:18:43,273 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 03:18:43,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 03:18:43,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 03:18:43,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 03:18:43,274 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 03:18:43,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-20 03:18:43,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 03:18:43,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 03:18:43,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 03:18:43,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 03:18:43,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 03:18:43,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 03:18:43,326 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 03:18:43,327 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 03:18:43,532 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 03:18:43,551 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 03:18:43,551 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-03-20 03:18:43,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 03:18:43 BoogieIcfgContainer [2022-03-20 03:18:43,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 03:18:43,553 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-20 03:18:43,554 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-20 03:18:43,555 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-20 03:18:43,557 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 03:18:43" (1/1) ... [2022-03-20 03:18:43,559 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-03-20 03:18:43,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 03:18:43 BasicIcfg [2022-03-20 03:18:43,582 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-20 03:18:43,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 03:18:43,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 03:18:43,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 03:18:43,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 03:18:42" (1/4) ... [2022-03-20 03:18:43,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e7f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 03:18:43, skipping insertion in model container [2022-03-20 03:18:43,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:18:43" (2/4) ... [2022-03-20 03:18:43,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e7f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 03:18:43, skipping insertion in model container [2022-03-20 03:18:43,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 03:18:43" (3/4) ... [2022-03-20 03:18:43,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e7f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 03:18:43, skipping insertion in model container [2022-03-20 03:18:43,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 03:18:43" (4/4) ... [2022-03-20 03:18:43,587 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_01-1.cJordan [2022-03-20 03:18:43,590 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-20 03:18:43,590 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 03:18:43,627 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 03:18:43,643 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-20 03:18:43,643 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 03:18:43,652 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-20 03:18:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 03:18:43,658 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:18:43,658 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-20 03:18:43,659 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:18:43,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:18:43,662 INFO L85 PathProgramCache]: Analyzing trace with hash -950788698, now seen corresponding path program 1 times [2022-03-20 03:18:43,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:18:43,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072899910] [2022-03-20 03:18:43,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:18:43,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:18:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:18:43,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:18:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:18:43,849 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-20 03:18:43,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:18:43,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072899910] [2022-03-20 03:18:43,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072899910] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 03:18:43,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 03:18:43,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 03:18:43,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649264432] [2022-03-20 03:18:43,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 03:18:43,854 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-20 03:18:43,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:18:43,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-20 03:18:43,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 03:18:43,873 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-20 03:18:43,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:18:43,915 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-03-20 03:18:43,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-20 03:18:43,921 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-20 03:18:43,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:18:43,925 INFO L225 Difference]: With dead ends: 37 [2022-03-20 03:18:43,925 INFO L226 Difference]: Without dead ends: 32 [2022-03-20 03:18:43,926 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-20 03:18:43,929 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-20 03:18:43,929 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-20 03:18:43,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-03-20 03:18:43,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-03-20 03:18:43,952 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-20 03:18:43,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-03-20 03:18:43,954 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 19 [2022-03-20 03:18:43,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:18:43,955 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-03-20 03:18:43,955 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-20 03:18:43,955 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-03-20 03:18:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 03:18:43,955 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:18:43,956 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-20 03:18:43,956 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 03:18:43,956 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:18:43,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:18:43,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1860236376, now seen corresponding path program 1 times [2022-03-20 03:18:43,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:18:43,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524769545] [2022-03-20 03:18:43,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:18:43,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:18:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:18:44,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:18:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:18:44,124 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-20 03:18:44,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:18:44,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524769545] [2022-03-20 03:18:44,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524769545] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 03:18:44,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 03:18:44,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 03:18:44,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274931964] [2022-03-20 03:18:44,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 03:18:44,126 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 03:18:44,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:18:44,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 03:18:44,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-20 03:18:44,127 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-20 03:18:44,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:18:44,375 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-03-20 03:18:44,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 03:18:44,376 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-20 03:18:44,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:18:44,380 INFO L225 Difference]: With dead ends: 60 [2022-03-20 03:18:44,380 INFO L226 Difference]: Without dead ends: 48 [2022-03-20 03:18:44,383 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-20 03:18:44,384 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 89 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 03:18:44,385 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 36 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 03:18:44,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-20 03:18:44,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2022-03-20 03:18:44,396 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-20 03:18:44,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-03-20 03:18:44,397 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 19 [2022-03-20 03:18:44,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:18:44,398 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-03-20 03:18:44,401 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-20 03:18:44,401 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-03-20 03:18:44,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-20 03:18:44,404 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:18:44,404 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-20 03:18:44,404 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 03:18:44,405 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:18:44,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:18:44,405 INFO L85 PathProgramCache]: Analyzing trace with hash 600491494, now seen corresponding path program 1 times [2022-03-20 03:18:44,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:18:44,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624002073] [2022-03-20 03:18:44,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:18:44,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:18:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:18:44,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:18:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:18:44,750 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-20 03:18:44,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:18:44,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624002073] [2022-03-20 03:18:44,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624002073] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:18:44,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245343912] [2022-03-20 03:18:44,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:18:44,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:18:44,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:18:44,753 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-20 03:18:44,791 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-20 03:18:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:18:44,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-20 03:18:44,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:18:45,027 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-20 03:18:45,192 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-20 03:18:45,243 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-20 03:18:45,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:18:45,370 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-20 03:18:45,374 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-20 03:18:45,428 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-20 03:18:45,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245343912] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:18:45,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:18:45,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-03-20 03:18:45,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605501644] [2022-03-20 03:18:45,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:18:45,429 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-20 03:18:45,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:18:45,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-20 03:18:45,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-03-20 03:18:45,429 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-20 03:18:45,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:18:45,805 INFO L93 Difference]: Finished difference Result 89 states and 112 transitions. [2022-03-20 03:18:45,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 03:18:45,805 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-20 03:18:45,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:18:45,809 INFO L225 Difference]: With dead ends: 89 [2022-03-20 03:18:45,809 INFO L226 Difference]: Without dead ends: 89 [2022-03-20 03:18:45,810 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-20 03:18:45,812 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 184 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 03:18:45,813 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 63 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 03:18:45,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-03-20 03:18:45,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 55. [2022-03-20 03:18:45,822 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-20 03:18:45,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2022-03-20 03:18:45,823 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 25 [2022-03-20 03:18:45,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:18:45,823 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2022-03-20 03:18:45,823 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-20 03:18:45,823 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2022-03-20 03:18:45,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-20 03:18:45,824 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:18:45,824 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-20 03:18:45,867 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-20 03:18:46,052 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-20 03:18:46,052 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:18:46,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:18:46,053 INFO L85 PathProgramCache]: Analyzing trace with hash 89957317, now seen corresponding path program 1 times [2022-03-20 03:18:46,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:18:46,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821422211] [2022-03-20 03:18:46,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:18:46,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:18:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:18:46,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:18:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:18:46,115 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-20 03:18:46,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:18:46,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821422211] [2022-03-20 03:18:46,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821422211] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 03:18:46,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 03:18:46,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 03:18:46,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850078410] [2022-03-20 03:18:46,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 03:18:46,117 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 03:18:46,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:18:46,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 03:18:46,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 03:18:46,118 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-20 03:18:46,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:18:46,191 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2022-03-20 03:18:46,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 03:18:46,192 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-20 03:18:46,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:18:46,193 INFO L225 Difference]: With dead ends: 57 [2022-03-20 03:18:46,193 INFO L226 Difference]: Without dead ends: 57 [2022-03-20 03:18:46,193 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-20 03:18:46,194 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 34 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-03-20 03:18:46,194 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.1s Time] [2022-03-20 03:18:46,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-03-20 03:18:46,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-03-20 03:18:46,197 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-20 03:18:46,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2022-03-20 03:18:46,197 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 25 [2022-03-20 03:18:46,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:18:46,198 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2022-03-20 03:18:46,198 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-20 03:18:46,198 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2022-03-20 03:18:46,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-20 03:18:46,198 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:18:46,198 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-20 03:18:46,198 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-20 03:18:46,199 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:18:46,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:18:46,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1971894797, now seen corresponding path program 1 times [2022-03-20 03:18:46,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:18:46,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589961161] [2022-03-20 03:18:46,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:18:46,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:18:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:18:46,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:18:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:18:46,303 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-20 03:18:46,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:18:46,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589961161] [2022-03-20 03:18:46,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589961161] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:18:46,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380886703] [2022-03-20 03:18:46,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:18:46,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:18:46,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:18:46,306 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-20 03:18:46,307 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-20 03:18:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:18:46,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-20 03:18:46,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:18:46,473 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-20 03:18:46,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:18:46,557 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-20 03:18:46,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380886703] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:18:46,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:18:46,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-03-20 03:18:46,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387481125] [2022-03-20 03:18:46,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:18:46,558 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 03:18:46,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:18:46,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 03:18:46,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-03-20 03:18:46,558 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-20 03:18:46,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:18:46,764 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2022-03-20 03:18:46,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 03:18:46,765 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-20 03:18:46,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:18:46,766 INFO L225 Difference]: With dead ends: 94 [2022-03-20 03:18:46,766 INFO L226 Difference]: Without dead ends: 94 [2022-03-20 03:18:46,766 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-20 03:18:46,767 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 105 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 03:18:46,767 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 63 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 03:18:46,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-03-20 03:18:46,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2022-03-20 03:18:46,779 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-20 03:18:46,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2022-03-20 03:18:46,782 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 28 [2022-03-20 03:18:46,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:18:46,782 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2022-03-20 03:18:46,783 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-20 03:18:46,783 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2022-03-20 03:18:46,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-20 03:18:46,786 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:18:46,787 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-20 03:18:46,806 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-20 03:18:47,004 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-20 03:18:47,004 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:18:47,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:18:47,004 INFO L85 PathProgramCache]: Analyzing trace with hash -190528417, now seen corresponding path program 1 times [2022-03-20 03:18:47,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:18:47,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039853721] [2022-03-20 03:18:47,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:18:47,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:18:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:18:47,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:18:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:18:47,103 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-20 03:18:47,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:18:47,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039853721] [2022-03-20 03:18:47,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039853721] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:18:47,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821550067] [2022-03-20 03:18:47,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:18:47,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:18:47,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:18:47,117 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-20 03:18:47,119 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-20 03:18:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:18:47,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-20 03:18:47,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:18:47,262 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-20 03:18:47,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:18:47,312 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-20 03:18:47,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821550067] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:18:47,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:18:47,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-03-20 03:18:47,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624979014] [2022-03-20 03:18:47,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:18:47,313 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 03:18:47,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:18:47,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 03:18:47,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-03-20 03:18:47,314 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-20 03:18:47,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:18:47,581 INFO L93 Difference]: Finished difference Result 165 states and 213 transitions. [2022-03-20 03:18:47,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 03:18:47,581 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-20 03:18:47,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:18:47,582 INFO L225 Difference]: With dead ends: 165 [2022-03-20 03:18:47,582 INFO L226 Difference]: Without dead ends: 165 [2022-03-20 03:18:47,582 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-20 03:18:47,583 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 144 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 03:18:47,583 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 79 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 03:18:47,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-03-20 03:18:47,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 87. [2022-03-20 03:18:47,586 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-20 03:18:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2022-03-20 03:18:47,587 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 28 [2022-03-20 03:18:47,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:18:47,587 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2022-03-20 03:18:47,587 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-20 03:18:47,587 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2022-03-20 03:18:47,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-20 03:18:47,587 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:18:47,588 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-20 03:18:47,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-20 03:18:47,800 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-20 03:18:47,800 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:18:47,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:18:47,801 INFO L85 PathProgramCache]: Analyzing trace with hash -85381645, now seen corresponding path program 1 times [2022-03-20 03:18:47,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:18:47,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064133915] [2022-03-20 03:18:47,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:18:47,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:18:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:18:48,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:18:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:18:48,088 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-20 03:18:48,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:18:48,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064133915] [2022-03-20 03:18:48,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064133915] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:18:48,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185599011] [2022-03-20 03:18:48,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:18:48,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:18:48,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:18:48,090 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-20 03:18:48,091 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-20 03:18:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:18:48,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-20 03:18:48,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:18:48,216 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-20 03:18:48,270 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-20 03:18:48,405 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-03-20 03:18:48,406 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-20 03:18:48,620 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-20 03:18:48,674 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-20 03:18:48,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:18:50,849 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-20 03:18:51,315 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-20 03:18:57,204 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-20 03:18:57,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185599011] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:18:57,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:18:57,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2022-03-20 03:18:57,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234516739] [2022-03-20 03:18:57,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:18:57,212 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-20 03:18:57,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:18:57,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-20 03:18:57,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=597, Unknown=3, NotChecked=102, Total=812 [2022-03-20 03:18:57,213 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-20 03:18:57,704 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-20 03:18:58,033 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-20 03:19:00,083 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-20 03:19:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:19:00,421 INFO L93 Difference]: Finished difference Result 130 states and 164 transitions. [2022-03-20 03:19:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-20 03:19:00,422 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-20 03:19:00,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:19:00,423 INFO L225 Difference]: With dead ends: 130 [2022-03-20 03:19:00,423 INFO L226 Difference]: Without dead ends: 130 [2022-03-20 03:19:00,424 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=195, Invalid=1225, Unknown=6, NotChecked=380, Total=1806 [2022-03-20 03:19:00,424 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 42 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 279 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 03:19:00,424 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 185 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 438 Invalid, 0 Unknown, 279 Unchecked, 0.2s Time] [2022-03-20 03:19:00,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-03-20 03:19:00,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 94. [2022-03-20 03:19:00,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 87 states have internal predecessors, (114), 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-20 03:19:00,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 121 transitions. [2022-03-20 03:19:00,428 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 121 transitions. Word has length 31 [2022-03-20 03:19:00,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:19:00,430 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 121 transitions. [2022-03-20 03:19:00,430 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-20 03:19:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2022-03-20 03:19:00,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-20 03:19:00,432 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:19:00,433 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-20 03:19:00,480 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-20 03:19:00,643 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-20 03:19:00,643 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:19:00,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:19:00,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1897789399, now seen corresponding path program 2 times [2022-03-20 03:19:00,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:19:00,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018862715] [2022-03-20 03:19:00,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:19:00,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:19:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:19:00,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:19:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:19:00,793 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-20 03:19:00,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:19:00,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018862715] [2022-03-20 03:19:00,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018862715] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:19:00,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747623332] [2022-03-20 03:19:00,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 03:19:00,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:19:00,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:19:00,794 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-20 03:19:00,796 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-20 03:19:00,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 03:19:00,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 03:19:00,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-20 03:19:00,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:19:00,883 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-20 03:19:00,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 03:19:00,929 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-20 03:19:00,998 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-20 03:19:01,033 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-20 03:19:01,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:19:03,172 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-20 03:19:03,184 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-20 03:19:03,187 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-20 03:19:03,249 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-20 03:19:03,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747623332] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:19:03,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:19:03,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 22 [2022-03-20 03:19:03,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950609976] [2022-03-20 03:19:03,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:19:03,250 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-20 03:19:03,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:19:03,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-20 03:19:03,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=353, Unknown=1, NotChecked=38, Total=462 [2022-03-20 03:19:03,251 INFO L87 Difference]: Start difference. First operand 94 states and 121 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-20 03:19:05,288 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-20 03:19:05,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:19:05,644 INFO L93 Difference]: Finished difference Result 161 states and 203 transitions. [2022-03-20 03:19:05,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-20 03:19:05,645 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-20 03:19:05,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:19:05,646 INFO L225 Difference]: With dead ends: 161 [2022-03-20 03:19:05,646 INFO L226 Difference]: Without dead ends: 161 [2022-03-20 03:19:05,647 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-20 03:19:05,647 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 160 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 03:19:05,647 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 75 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 502 Invalid, 0 Unknown, 106 Unchecked, 0.2s Time] [2022-03-20 03:19:05,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-03-20 03:19:05,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 82. [2022-03-20 03:19:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 75 states have internal predecessors, (97), 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-20 03:19:05,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2022-03-20 03:19:05,651 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 31 [2022-03-20 03:19:05,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:19:05,651 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2022-03-20 03:19:05,651 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-20 03:19:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2022-03-20 03:19:05,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-20 03:19:05,651 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:19:05,652 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-20 03:19:05,671 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-20 03:19:05,852 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-20 03:19:05,852 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:19:05,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:19:05,853 INFO L85 PathProgramCache]: Analyzing trace with hash 873363003, now seen corresponding path program 1 times [2022-03-20 03:19:05,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:19:05,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089151991] [2022-03-20 03:19:05,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:19:05,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:19:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:19:05,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:19:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:19:05,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 03:19:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:19:05,946 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-20 03:19:05,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:19:05,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089151991] [2022-03-20 03:19:05,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089151991] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:19:05,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293291157] [2022-03-20 03:19:05,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:19:05,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:19:05,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:19:05,948 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-20 03:19:05,988 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-20 03:19:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:19:06,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-20 03:19:06,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:19:06,109 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-20 03:19:06,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:19:06,191 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-20 03:19:06,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293291157] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:19:06,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:19:06,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-03-20 03:19:06,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567212409] [2022-03-20 03:19:06,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:19:06,192 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 03:19:06,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:19:06,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 03:19:06,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-03-20 03:19:06,193 INFO L87 Difference]: Start difference. First operand 82 states and 104 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-20 03:19:06,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:19:06,452 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2022-03-20 03:19:06,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 03:19:06,452 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-20 03:19:06,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:19:06,453 INFO L225 Difference]: With dead ends: 164 [2022-03-20 03:19:06,453 INFO L226 Difference]: Without dead ends: 138 [2022-03-20 03:19:06,453 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-20 03:19:06,454 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 171 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 03:19:06,454 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 53 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 03:19:06,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-03-20 03:19:06,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 96. [2022-03-20 03:19:06,457 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-20 03:19:06,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2022-03-20 03:19:06,458 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 33 [2022-03-20 03:19:06,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:19:06,458 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2022-03-20 03:19:06,458 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-20 03:19:06,458 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2022-03-20 03:19:06,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-20 03:19:06,458 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:19:06,458 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-20 03:19:06,478 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-20 03:19:06,659 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-20 03:19:06,659 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:19:06,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:19:06,660 INFO L85 PathProgramCache]: Analyzing trace with hash 2112270400, now seen corresponding path program 2 times [2022-03-20 03:19:06,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:19:06,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744438279] [2022-03-20 03:19:06,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:19:06,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:19:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:19:06,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:19:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:19:06,715 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-20 03:19:06,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:19:06,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744438279] [2022-03-20 03:19:06,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744438279] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:19:06,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111935637] [2022-03-20 03:19:06,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 03:19:06,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:19:06,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:19:06,728 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-20 03:19:06,729 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-20 03:19:06,852 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 03:19:06,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 03:19:06,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-20 03:19:06,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:19:06,928 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-20 03:19:06,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:19:06,972 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-20 03:19:06,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111935637] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:19:06,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:19:06,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-03-20 03:19:06,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447161825] [2022-03-20 03:19:06,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:19:06,973 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 03:19:06,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:19:06,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 03:19:06,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-20 03:19:06,974 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-20 03:19:07,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:19:07,194 INFO L93 Difference]: Finished difference Result 174 states and 217 transitions. [2022-03-20 03:19:07,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 03:19:07,194 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-20 03:19:07,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:19:07,195 INFO L225 Difference]: With dead ends: 174 [2022-03-20 03:19:07,195 INFO L226 Difference]: Without dead ends: 174 [2022-03-20 03:19:07,195 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-20 03:19:07,195 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 136 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 03:19:07,196 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 75 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 03:19:07,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-03-20 03:19:07,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 128. [2022-03-20 03:19:07,199 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-20 03:19:07,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 160 transitions. [2022-03-20 03:19:07,199 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 160 transitions. Word has length 34 [2022-03-20 03:19:07,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:19:07,199 INFO L478 AbstractCegarLoop]: Abstraction has 128 states and 160 transitions. [2022-03-20 03:19:07,199 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-20 03:19:07,199 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2022-03-20 03:19:07,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-20 03:19:07,200 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:19:07,200 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-20 03:19:07,220 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-20 03:19:07,400 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-20 03:19:07,400 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:19:07,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:19:07,401 INFO L85 PathProgramCache]: Analyzing trace with hash -848526202, now seen corresponding path program 3 times [2022-03-20 03:19:07,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:19:07,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137041686] [2022-03-20 03:19:07,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:19:07,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:19:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:19:08,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:19:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:19:08,068 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-20 03:19:08,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:19:08,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137041686] [2022-03-20 03:19:08,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137041686] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:19:08,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845391202] [2022-03-20 03:19:08,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 03:19:08,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:19:08,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:19:08,072 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-20 03:19:08,081 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-20 03:19:08,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-20 03:19:08,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 03:19:08,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-20 03:19:08,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:19:08,203 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-20 03:19:08,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 03:19:08,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 03:19:08,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 03:19:08,295 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-20 03:19:08,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 03:19:08,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 03:19:08,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 03:19:08,486 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-20 03:19:08,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 03:19:08,492 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-03-20 03:19:08,492 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-20 03:19:08,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 03:19:08,636 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-03-20 03:19:08,637 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-20 03:19:09,813 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-20 03:19:09,886 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-20 03:19:09,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:19:30,217 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-20 03:20:08,882 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-20 03:20:08,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845391202] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:20:08,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:20:08,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 48 [2022-03-20 03:20:08,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533045326] [2022-03-20 03:20:08,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:20:08,884 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-20 03:20:08,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:20:08,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-20 03:20:08,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=1832, Unknown=13, NotChecked=90, Total=2256 [2022-03-20 03:20:08,886 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-20 03:20:09,593 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-20 03:20:10,134 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-20 03:20:11,036 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 |c_main_~#Dest~0.offset|) 1) (= (select .cse0 .cse1) 3) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (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)) (= .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-20 03:20:13,076 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-20 03:20:14,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:20:14,047 INFO L93 Difference]: Finished difference Result 272 states and 342 transitions. [2022-03-20 03:20:14,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-20 03:20:14,047 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-20 03:20:14,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:20:14,051 INFO L225 Difference]: With dead ends: 272 [2022-03-20 03:20:14,051 INFO L226 Difference]: Without dead ends: 246 [2022-03-20 03:20:14,052 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 63.9s TimeCoverageRelationStatistics Valid=704, Invalid=4701, Unknown=17, NotChecked=740, Total=6162 [2022-03-20 03:20:14,057 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 171 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 965 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 03:20:14,057 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 240 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 620 Invalid, 0 Unknown, 965 Unchecked, 0.4s Time] [2022-03-20 03:20:14,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-03-20 03:20:14,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 153. [2022-03-20 03:20:14,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 144 states have (on average 1.2986111111111112) internal successors, (187), 146 states have internal predecessors, (187), 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-20 03:20:14,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 195 transitions. [2022-03-20 03:20:14,061 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 195 transitions. Word has length 37 [2022-03-20 03:20:14,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:20:14,061 INFO L478 AbstractCegarLoop]: Abstraction has 153 states and 195 transitions. [2022-03-20 03:20:14,062 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-20 03:20:14,062 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 195 transitions. [2022-03-20 03:20:14,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-20 03:20:14,062 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:20:14,062 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-20 03:20:14,098 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-20 03:20:14,295 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-20 03:20:14,296 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:20:14,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:20:14,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1692998073, now seen corresponding path program 1 times [2022-03-20 03:20:14,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:20:14,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363391054] [2022-03-20 03:20:14,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:20:14,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:20:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:20:14,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:20:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:20:14,685 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-20 03:20:14,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:20:14,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363391054] [2022-03-20 03:20:14,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363391054] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:20:14,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961806679] [2022-03-20 03:20:14,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:20:14,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:20:14,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:20:14,687 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-20 03:20:14,716 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-20 03:20:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:20:14,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-20 03:20:14,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:20:14,804 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-20 03:20:14,874 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-20 03:20:14,994 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-03-20 03:20:14,994 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-20 03:20:15,195 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-20 03:20:15,229 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-20 03:20:15,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:20:17,353 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-20 03:20:17,856 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-20 03:20:23,035 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-20 03:20:23,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961806679] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:20:23,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:20:23,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 30 [2022-03-20 03:20:23,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489011799] [2022-03-20 03:20:23,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:20:23,036 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-20 03:20:23,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:20:23,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-20 03:20:23,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=642, Unknown=3, NotChecked=106, Total=870 [2022-03-20 03:20:23,037 INFO L87 Difference]: Start difference. First operand 153 states and 195 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-20 03:20:23,461 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-20 03:20:23,822 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-20 03:20:25,849 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-20 03:20:26,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:20:26,156 INFO L93 Difference]: Finished difference Result 176 states and 221 transitions. [2022-03-20 03:20:26,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-20 03:20:26,156 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-20 03:20:26,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:20:26,157 INFO L225 Difference]: With dead ends: 176 [2022-03-20 03:20:26,157 INFO L226 Difference]: Without dead ends: 159 [2022-03-20 03:20:26,158 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=194, Invalid=1152, Unknown=6, NotChecked=370, Total=1722 [2022-03-20 03:20:26,158 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 44 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 213 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 03:20:26,158 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 247 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 472 Invalid, 0 Unknown, 213 Unchecked, 0.2s Time] [2022-03-20 03:20:26,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-03-20 03:20:26,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 150. [2022-03-20 03:20:26,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 141 states have (on average 1.297872340425532) internal successors, (183), 143 states have internal predecessors, (183), 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-20 03:20:26,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 191 transitions. [2022-03-20 03:20:26,161 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 191 transitions. Word has length 37 [2022-03-20 03:20:26,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:20:26,161 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 191 transitions. [2022-03-20 03:20:26,161 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-20 03:20:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 191 transitions. [2022-03-20 03:20:26,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-20 03:20:26,162 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:20:26,162 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-20 03:20:26,185 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-20 03:20:26,363 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-20 03:20:26,364 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:20:26,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:20:26,364 INFO L85 PathProgramCache]: Analyzing trace with hash 672670965, now seen corresponding path program 4 times [2022-03-20 03:20:26,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:20:26,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551414804] [2022-03-20 03:20:26,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:20:26,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:20:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:20:26,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:20:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:20:26,455 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-20 03:20:26,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:20:26,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551414804] [2022-03-20 03:20:26,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551414804] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:20:26,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066942446] [2022-03-20 03:20:26,455 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 03:20:26,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:20:26,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:20:26,457 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-20 03:20:26,496 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-20 03:20:26,526 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 03:20:26,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 03:20:26,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-20 03:20:26,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:20:26,579 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-20 03:20:26,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 03:20:26,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066942446] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 03:20:26,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 03:20:26,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-03-20 03:20:26,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719883580] [2022-03-20 03:20:26,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 03:20:26,580 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 03:20:26,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:20:26,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 03:20:26,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-20 03:20:26,580 INFO L87 Difference]: Start difference. First operand 150 states and 191 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-20 03:20:26,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:20:26,622 INFO L93 Difference]: Finished difference Result 150 states and 190 transitions. [2022-03-20 03:20:26,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 03:20:26,622 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-20 03:20:26,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:20:26,623 INFO L225 Difference]: With dead ends: 150 [2022-03-20 03:20:26,623 INFO L226 Difference]: Without dead ends: 150 [2022-03-20 03:20:26,623 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-20 03:20:26,624 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-20 03:20:26,624 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-20 03:20:26,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-03-20 03:20:26,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-03-20 03:20:26,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 141 states have (on average 1.2907801418439717) internal successors, (182), 143 states have internal predecessors, (182), 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-20 03:20:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 190 transitions. [2022-03-20 03:20:26,628 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 190 transitions. Word has length 37 [2022-03-20 03:20:26,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:20:26,628 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 190 transitions. [2022-03-20 03:20:26,628 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-20 03:20:26,628 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 190 transitions. [2022-03-20 03:20:26,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-20 03:20:26,629 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:20:26,629 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-20 03:20:26,659 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-20 03:20:26,845 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-20 03:20:26,845 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:20:26,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:20:26,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1404538378, now seen corresponding path program 1 times [2022-03-20 03:20:26,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:20:26,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123400531] [2022-03-20 03:20:26,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:20:26,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:20:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:20:26,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:20:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:20:26,896 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-20 03:20:26,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:20:26,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123400531] [2022-03-20 03:20:26,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123400531] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 03:20:26,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 03:20:26,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 03:20:26,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095336017] [2022-03-20 03:20:26,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 03:20:26,897 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 03:20:26,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:20:26,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 03:20:26,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-20 03:20:26,899 INFO L87 Difference]: Start difference. First operand 150 states and 190 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-20 03:20:26,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:20:26,977 INFO L93 Difference]: Finished difference Result 163 states and 206 transitions. [2022-03-20 03:20:26,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 03:20:26,977 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-20 03:20:26,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:20:26,978 INFO L225 Difference]: With dead ends: 163 [2022-03-20 03:20:26,978 INFO L226 Difference]: Without dead ends: 163 [2022-03-20 03:20:26,978 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-20 03:20:26,979 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-20 03:20:26,979 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-20 03:20:26,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-03-20 03:20:26,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2022-03-20 03:20:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 141 states have (on average 1.2836879432624113) internal successors, (181), 143 states have internal predecessors, (181), 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-20 03:20:26,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 189 transitions. [2022-03-20 03:20:26,982 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 189 transitions. Word has length 37 [2022-03-20 03:20:26,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:20:26,982 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 189 transitions. [2022-03-20 03:20:26,982 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-20 03:20:26,982 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 189 transitions. [2022-03-20 03:20:26,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-20 03:20:26,982 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:20:26,982 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-20 03:20:26,982 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-20 03:20:26,983 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:20:26,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:20:26,983 INFO L85 PathProgramCache]: Analyzing trace with hash 179094910, now seen corresponding path program 1 times [2022-03-20 03:20:26,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:20:26,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632860666] [2022-03-20 03:20:26,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:20:26,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:20:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:20:27,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:20:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:20:27,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 03:20:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:20:27,132 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-20 03:20:27,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:20:27,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632860666] [2022-03-20 03:20:27,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632860666] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:20:27,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224400367] [2022-03-20 03:20:27,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:20:27,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:20:27,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:20:27,134 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-20 03:20:27,135 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-20 03:20:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:20:27,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-20 03:20:27,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:20:27,264 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-20 03:20:29,380 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-20 03:20:29,404 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-20 03:20:29,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:20:29,798 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-20 03:20:29,801 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-20 03:20:29,885 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-20 03:20:29,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224400367] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:20:29,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:20:29,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 28 [2022-03-20 03:20:29,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415222578] [2022-03-20 03:20:29,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:20:29,886 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-20 03:20:29,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:20:29,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-20 03:20:29,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=654, Unknown=2, NotChecked=0, Total=756 [2022-03-20 03:20:29,887 INFO L87 Difference]: Start difference. First operand 150 states and 189 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-20 03:20:30,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:20:30,758 INFO L93 Difference]: Finished difference Result 305 states and 383 transitions. [2022-03-20 03:20:30,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-20 03:20:30,759 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-20 03:20:30,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:20:30,760 INFO L225 Difference]: With dead ends: 305 [2022-03-20 03:20:30,760 INFO L226 Difference]: Without dead ends: 305 [2022-03-20 03:20:30,761 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=443, Invalid=2635, Unknown=2, NotChecked=0, Total=3080 [2022-03-20 03:20:30,761 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 380 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 213 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 03:20:30,761 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [380 Valid, 115 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 944 Invalid, 0 Unknown, 213 Unchecked, 0.4s Time] [2022-03-20 03:20:30,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-03-20 03:20:30,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 173. [2022-03-20 03:20:30,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 162 states have (on average 1.271604938271605) internal successors, (206), 164 states have internal predecessors, (206), 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-20 03:20:30,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 216 transitions. [2022-03-20 03:20:30,765 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 216 transitions. Word has length 39 [2022-03-20 03:20:30,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:20:30,765 INFO L478 AbstractCegarLoop]: Abstraction has 173 states and 216 transitions. [2022-03-20 03:20:30,766 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-20 03:20:30,766 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 216 transitions. [2022-03-20 03:20:30,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-20 03:20:30,766 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:20:30,766 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-20 03:20:30,789 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-20 03:20:30,980 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-20 03:20:30,980 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:20:30,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:20:30,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1199172686, now seen corresponding path program 2 times [2022-03-20 03:20:30,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:20:30,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354020057] [2022-03-20 03:20:30,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:20:30,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:20:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:20:31,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:20:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:20:31,078 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-20 03:20:31,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:20:31,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354020057] [2022-03-20 03:20:31,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354020057] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:20:31,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593606711] [2022-03-20 03:20:31,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 03:20:31,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:20:31,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:20:31,080 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-20 03:20:31,082 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-20 03:20:31,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 03:20:31,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 03:20:31,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-20 03:20:31,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:20:31,312 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-20 03:20:31,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:20:31,375 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-20 03:20:31,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593606711] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:20:31,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:20:31,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-03-20 03:20:31,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077916623] [2022-03-20 03:20:31,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:20:31,376 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-20 03:20:31,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:20:31,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-20 03:20:31,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-03-20 03:20:31,376 INFO L87 Difference]: Start difference. First operand 173 states and 216 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-20 03:20:31,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:20:31,723 INFO L93 Difference]: Finished difference Result 356 states and 450 transitions. [2022-03-20 03:20:31,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-20 03:20:31,723 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-20 03:20:31,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:20:31,724 INFO L225 Difference]: With dead ends: 356 [2022-03-20 03:20:31,725 INFO L226 Difference]: Without dead ends: 356 [2022-03-20 03:20:31,725 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-20 03:20:31,725 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 165 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 03:20:31,725 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 90 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 03:20:31,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-03-20 03:20:31,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 227. [2022-03-20 03:20:31,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 218 states have internal predecessors, (280), 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-20 03:20:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 290 transitions. [2022-03-20 03:20:31,738 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 290 transitions. Word has length 40 [2022-03-20 03:20:31,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:20:31,738 INFO L478 AbstractCegarLoop]: Abstraction has 227 states and 290 transitions. [2022-03-20 03:20:31,738 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-20 03:20:31,739 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 290 transitions. [2022-03-20 03:20:31,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-20 03:20:31,740 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:20:31,740 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-20 03:20:31,757 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-20 03:20:31,952 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-20 03:20:31,952 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:20:31,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:20:31,953 INFO L85 PathProgramCache]: Analyzing trace with hash -823687205, now seen corresponding path program 2 times [2022-03-20 03:20:31,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:20:31,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058607350] [2022-03-20 03:20:31,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:20:31,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:20:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:20:32,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:20:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:20:32,441 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-20 03:20:32,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:20:32,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058607350] [2022-03-20 03:20:32,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058607350] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:20:32,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541045860] [2022-03-20 03:20:32,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 03:20:32,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:20:32,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:20:32,443 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-20 03:20:32,444 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-20 03:20:32,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 03:20:32,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 03:20:32,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-20 03:20:32,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:20:32,548 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-20 03:20:32,571 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-20 03:20:32,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 03:20:32,641 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-20 03:20:32,747 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-03-20 03:20:32,748 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-20 03:20:32,804 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-03-20 03:20:32,805 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-20 03:20:32,917 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-20 03:20:32,946 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-20 03:20:32,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:20:36,487 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-20 03:20:36,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541045860] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:20:36,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:20:36,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 16] total 39 [2022-03-20 03:20:36,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425415671] [2022-03-20 03:20:36,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:20:36,488 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-20 03:20:36,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:20:36,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-20 03:20:36,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1266, Unknown=4, NotChecked=0, Total=1482 [2022-03-20 03:20:36,489 INFO L87 Difference]: Start difference. First operand 227 states and 290 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-20 03:20:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:20:37,745 INFO L93 Difference]: Finished difference Result 693 states and 909 transitions. [2022-03-20 03:20:37,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-20 03:20:37,745 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-20 03:20:37,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:20:37,747 INFO L225 Difference]: With dead ends: 693 [2022-03-20 03:20:37,747 INFO L226 Difference]: Without dead ends: 693 [2022-03-20 03:20:37,748 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 73 SyntacticMatches, 13 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=689, Invalid=3089, Unknown=4, NotChecked=0, Total=3782 [2022-03-20 03:20:37,749 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 294 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 507 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-20 03:20:37,749 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 93 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 971 Invalid, 0 Unknown, 507 Unchecked, 0.5s Time] [2022-03-20 03:20:37,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2022-03-20 03:20:37,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 310. [2022-03-20 03:20:37,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 299 states have (on average 1.3411371237458194) internal successors, (401), 301 states have internal predecessors, (401), 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-20 03:20:37,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 411 transitions. [2022-03-20 03:20:37,768 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 411 transitions. Word has length 40 [2022-03-20 03:20:37,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:20:37,769 INFO L478 AbstractCegarLoop]: Abstraction has 310 states and 411 transitions. [2022-03-20 03:20:37,769 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-20 03:20:37,770 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 411 transitions. [2022-03-20 03:20:37,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-20 03:20:37,770 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:20:37,770 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-20 03:20:37,788 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-20 03:20:37,971 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-20 03:20:37,972 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:20:37,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:20:37,972 INFO L85 PathProgramCache]: Analyzing trace with hash -945679404, now seen corresponding path program 3 times [2022-03-20 03:20:37,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:20:37,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442870928] [2022-03-20 03:20:37,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:20:37,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:20:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:20:38,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:20:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:20:38,558 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-20 03:20:38,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:20:38,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442870928] [2022-03-20 03:20:38,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442870928] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:20:38,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103439988] [2022-03-20 03:20:38,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 03:20:38,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:20:38,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:20:38,560 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-20 03:20:38,561 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-20 03:20:38,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-20 03:20:38,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 03:20:38,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-20 03:20:38,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:20:38,730 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-20 03:20:38,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-20 03:20:38,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 03:20:38,819 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-20 03:20:38,819 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-20 03:20:39,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-20 03:20:39,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 03:20:39,077 INFO L356 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2022-03-20 03:20:39,077 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-20 03:20:39,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 03:20:39,394 INFO L356 Elim1Store]: treesize reduction 238, result has 26.8 percent of original size [2022-03-20 03:20:39,395 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-20 03:20:52,068 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-20 03:20:52,068 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-20 03:20:52,154 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-20 03:20:52,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:20:53,918 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-20 03:20:54,978 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-20 03:20:55,729 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-20 03:21:01,291 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-20 03:21:01,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103439988] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:21:01,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:21:01,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 21] total 55 [2022-03-20 03:21:01,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747888002] [2022-03-20 03:21:01,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:21:01,294 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-03-20 03:21:01,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:21:01,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-03-20 03:21:01,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=2253, Unknown=11, NotChecked=306, Total=2970 [2022-03-20 03:21:01,307 INFO L87 Difference]: Start difference. First operand 310 states and 411 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-20 03:21:02,280 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-20 03:21:03,075 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-20 03:21:03,885 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-20 03:21:04,692 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-20 03:21:08,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:21:08,620 INFO L93 Difference]: Finished difference Result 426 states and 550 transitions. [2022-03-20 03:21:08,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-20 03:21:08,621 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-20 03:21:08,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:21:08,622 INFO L225 Difference]: With dead ends: 426 [2022-03-20 03:21:08,622 INFO L226 Difference]: Without dead ends: 398 [2022-03-20 03:21:08,625 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 112 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 3099 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=1680, Invalid=9675, Unknown=15, NotChecked=1512, Total=12882 [2022-03-20 03:21:08,625 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 189 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 2786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1611 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-20 03:21:08,625 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 171 Invalid, 2786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1095 Invalid, 0 Unknown, 1611 Unchecked, 0.5s Time] [2022-03-20 03:21:08,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-03-20 03:21:08,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 327. [2022-03-20 03:21:08,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 316 states have (on average 1.3354430379746836) internal successors, (422), 318 states have internal predecessors, (422), 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-20 03:21:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 432 transitions. [2022-03-20 03:21:08,631 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 432 transitions. Word has length 43 [2022-03-20 03:21:08,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:21:08,631 INFO L478 AbstractCegarLoop]: Abstraction has 327 states and 432 transitions. [2022-03-20 03:21:08,631 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-20 03:21:08,631 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 432 transitions. [2022-03-20 03:21:08,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-20 03:21:08,632 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:21:08,632 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-20 03:21:08,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-20 03:21:08,832 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-20 03:21:08,832 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:21:08,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:21:08,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1200415949, now seen corresponding path program 4 times [2022-03-20 03:21:08,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:21:08,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088334629] [2022-03-20 03:21:08,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:21:08,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:21:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:21:09,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:21:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:21:09,163 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-20 03:21:09,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:21:09,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088334629] [2022-03-20 03:21:09,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088334629] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:21:09,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833910776] [2022-03-20 03:21:09,163 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 03:21:09,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:21:09,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:21:09,165 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-20 03:21:09,166 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-20 03:21:09,314 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 03:21:09,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 03:21:09,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-20 03:21:09,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:21:09,330 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-20 03:21:09,376 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-20 03:21:09,780 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-03-20 03:21:09,780 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-20 03:21:18,572 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-03-20 03:21:18,572 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-20 03:21:18,632 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-20 03:21:18,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:21:34,191 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-20 03:21:34,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833910776] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:21:34,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:21:34,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 19] total 46 [2022-03-20 03:21:34,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179597272] [2022-03-20 03:21:34,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:21:34,192 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-20 03:21:34,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:21:34,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-20 03:21:34,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1781, Unknown=19, NotChecked=0, Total=2070 [2022-03-20 03:21:34,193 INFO L87 Difference]: Start difference. First operand 327 states and 432 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-20 03:21:40,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:21:40,454 INFO L93 Difference]: Finished difference Result 354 states and 461 transitions. [2022-03-20 03:21:40,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-20 03:21:40,454 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-20 03:21:40,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:21:40,455 INFO L225 Difference]: With dead ends: 354 [2022-03-20 03:21:40,455 INFO L226 Difference]: Without dead ends: 334 [2022-03-20 03:21:40,457 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 47 SyntacticMatches, 16 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1519 ImplicationChecksByTransitivity, 29.9s TimeCoverageRelationStatistics Valid=625, Invalid=3774, Unknown=23, NotChecked=0, Total=4422 [2022-03-20 03:21:40,457 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 69 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 618 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 03:21:40,457 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 177 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 247 Invalid, 0 Unknown, 618 Unchecked, 0.1s Time] [2022-03-20 03:21:40,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-03-20 03:21:40,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 330. [2022-03-20 03:21:40,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 319 states have (on average 1.335423197492163) internal successors, (426), 321 states have internal predecessors, (426), 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-20 03:21:40,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 436 transitions. [2022-03-20 03:21:40,462 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 436 transitions. Word has length 43 [2022-03-20 03:21:40,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:21:40,462 INFO L478 AbstractCegarLoop]: Abstraction has 330 states and 436 transitions. [2022-03-20 03:21:40,462 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-20 03:21:40,462 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 436 transitions. [2022-03-20 03:21:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-03-20 03:21:40,463 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:21:40,463 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-20 03:21:40,486 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-20 03:21:40,663 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-20 03:21:40,664 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:21:40,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:21:40,664 INFO L85 PathProgramCache]: Analyzing trace with hash -584884781, now seen corresponding path program 2 times [2022-03-20 03:21:40,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:21:40,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501574278] [2022-03-20 03:21:40,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:21:40,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:21:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:21:40,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:21:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:21:40,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 03:21:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:21:40,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-03-20 03:21:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:21:40,763 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-20 03:21:40,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:21:40,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501574278] [2022-03-20 03:21:40,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501574278] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:21:40,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48895081] [2022-03-20 03:21:40,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 03:21:40,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:21:40,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:21:40,779 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-20 03:21:40,780 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-20 03:21:40,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 03:21:40,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 03:21:40,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-20 03:21:40,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:21:40,975 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-20 03:21:40,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:21:41,054 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-20 03:21:41,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48895081] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:21:41,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:21:41,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-03-20 03:21:41,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087894006] [2022-03-20 03:21:41,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:21:41,055 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-20 03:21:41,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:21:41,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-20 03:21:41,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-03-20 03:21:41,055 INFO L87 Difference]: Start difference. First operand 330 states and 436 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-20 03:21:41,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:21:41,463 INFO L93 Difference]: Finished difference Result 838 states and 1112 transitions. [2022-03-20 03:21:41,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-20 03:21:41,463 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-20 03:21:41,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:21:41,465 INFO L225 Difference]: With dead ends: 838 [2022-03-20 03:21:41,465 INFO L226 Difference]: Without dead ends: 782 [2022-03-20 03:21:41,465 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-20 03:21:41,466 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 327 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 03:21:41,466 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [328 Valid, 61 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 03:21:41,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2022-03-20 03:21:41,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 566. [2022-03-20 03:21:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 553 states have (on average 1.3508137432188065) internal successors, (747), 556 states have internal predecessors, (747), 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-20 03:21:41,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 761 transitions. [2022-03-20 03:21:41,478 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 761 transitions. Word has length 47 [2022-03-20 03:21:41,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:21:41,478 INFO L478 AbstractCegarLoop]: Abstraction has 566 states and 761 transitions. [2022-03-20 03:21:41,478 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-20 03:21:41,478 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 761 transitions. [2022-03-20 03:21:41,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-20 03:21:41,480 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:21:41,480 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-20 03:21:41,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-20 03:21:41,697 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-20 03:21:41,698 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:21:41,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:21:41,698 INFO L85 PathProgramCache]: Analyzing trace with hash 2040872352, now seen corresponding path program 5 times [2022-03-20 03:21:41,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:21:41,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385134807] [2022-03-20 03:21:41,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:21:41,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:21:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:21:41,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:21:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:21:41,804 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-20 03:21:41,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:21:41,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385134807] [2022-03-20 03:21:41,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385134807] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:21:41,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514503570] [2022-03-20 03:21:41,804 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-20 03:21:41,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:21:41,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:21:41,816 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-20 03:21:41,818 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-20 03:21:42,107 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-20 03:21:42,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 03:21:42,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-20 03:21:42,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:21:42,241 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-20 03:21:42,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:21:42,313 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-20 03:21:42,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514503570] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:21:42,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:21:42,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-03-20 03:21:42,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915617599] [2022-03-20 03:21:42,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:21:42,314 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-20 03:21:42,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:21:42,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-20 03:21:42,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-03-20 03:21:42,315 INFO L87 Difference]: Start difference. First operand 566 states and 761 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-20 03:21:42,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:21:42,862 INFO L93 Difference]: Finished difference Result 1218 states and 1616 transitions. [2022-03-20 03:21:42,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-20 03:21:42,863 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-20 03:21:42,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:21:42,866 INFO L225 Difference]: With dead ends: 1218 [2022-03-20 03:21:42,866 INFO L226 Difference]: Without dead ends: 1218 [2022-03-20 03:21:42,866 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-20 03:21:42,867 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 196 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 03:21:42,867 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 95 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 03:21:42,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2022-03-20 03:21:42,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 755. [2022-03-20 03:21:42,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 742 states have (on average 1.3827493261455526) internal successors, (1026), 745 states have internal predecessors, (1026), 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-20 03:21:42,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1040 transitions. [2022-03-20 03:21:42,881 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1040 transitions. Word has length 46 [2022-03-20 03:21:42,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:21:42,881 INFO L478 AbstractCegarLoop]: Abstraction has 755 states and 1040 transitions. [2022-03-20 03:21:42,881 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-20 03:21:42,881 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1040 transitions. [2022-03-20 03:21:42,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-20 03:21:42,882 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:21:42,882 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-20 03:21:42,887 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-20 03:21:43,087 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-20 03:21:43,087 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:21:43,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:21:43,087 INFO L85 PathProgramCache]: Analyzing trace with hash 640274542, now seen corresponding path program 3 times [2022-03-20 03:21:43,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:21:43,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348109479] [2022-03-20 03:21:43,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:21:43,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:21:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:21:43,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:21:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:21:43,139 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-20 03:21:43,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:21:43,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348109479] [2022-03-20 03:21:43,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348109479] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:21:43,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518303965] [2022-03-20 03:21:43,139 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 03:21:43,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:21:43,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:21:43,140 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-20 03:21:43,142 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-20 03:21:43,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-20 03:21:43,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 03:21:43,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 61 conjunts are in the unsatisfiable core [2022-03-20 03:21:43,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:21:43,302 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-20 03:21:43,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 03:21:43,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 03:21:43,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 03:21:43,380 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-03-20 03:21:43,380 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-20 03:21:43,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 03:21:43,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 03:21:43,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 03:21:43,537 INFO L356 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2022-03-20 03:21:43,537 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-20 03:21:43,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 03:21:43,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 03:21:43,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-20 03:21:43,814 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-03-20 03:21:43,815 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-20 03:21:44,121 INFO L356 Elim1Store]: treesize reduction 160, result has 44.3 percent of original size [2022-03-20 03:21:44,121 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-20 03:21:48,351 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-20 03:21:48,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:22:11,867 WARN L833 $PredicateComparison]: unable to prove that (forall ((|main_~#distance~0.offset| Int) (v_ArrVal_826 Int) (v_ArrVal_824 Int) (v_ArrVal_821 Int)) (or (let ((.cse0 (let ((.cse2 (let ((.cse3 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ .cse3 |main_~#distance~0.offset|) v_ArrVal_821) (+ .cse3 |main_~#distance~0.offset| 4) v_ArrVal_824)))) (store .cse2 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse2) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_826)))) (let ((.cse1 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0))) (<= (select .cse0 (+ (* (select (select .cse1 |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)) (+ (select .cse0 (+ (* (select (select .cse1 |c_main_~#Source~0.base|) |c_main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select .cse1 |c_main_~#Weight~0.base|) |c_main_~#Weight~0.offset|))))) (not (<= (+ v_ArrVal_826 1) 0)) (not (<= 0 v_ArrVal_821)))) is different from false [2022-03-20 03:22:11,943 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-03-20 03:22:11,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518303965] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:22:11,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:22:11,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19, 19] total 39 [2022-03-20 03:22:11,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155837074] [2022-03-20 03:22:11,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:22:11,944 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-20 03:22:11,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:22:11,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-20 03:22:11,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1253, Unknown=11, NotChecked=72, Total=1482 [2022-03-20 03:22:11,944 INFO L87 Difference]: Start difference. First operand 755 states and 1040 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-20 03:22:18,939 WARN L232 SmtUtils]: Spent 6.92s on a formula simplification. DAG size of input: 87 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 03:22:38,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:22:38,525 INFO L93 Difference]: Finished difference Result 2376 states and 2944 transitions. [2022-03-20 03:22:38,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 333 states. [2022-03-20 03:22:38,527 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-20 03:22:38,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:22:38,531 INFO L225 Difference]: With dead ends: 2376 [2022-03-20 03:22:38,531 INFO L226 Difference]: Without dead ends: 2108 [2022-03-20 03:22:38,548 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 367 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 57492 ImplicationChecksByTransitivity, 47.8s TimeCoverageRelationStatistics Valid=11355, Invalid=123694, Unknown=11, NotChecked=732, Total=135792 [2022-03-20 03:22:38,549 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 1345 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 3395 mSolverCounterSat, 1065 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1345 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 6658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1065 IncrementalHoareTripleChecker+Valid, 3395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2198 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-20 03:22:38,549 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1345 Valid, 161 Invalid, 6658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1065 Valid, 3395 Invalid, 0 Unknown, 2198 Unchecked, 2.1s Time] [2022-03-20 03:22:38,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2022-03-20 03:22:38,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 771. [2022-03-20 03:22:38,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 758 states have (on average 1.3034300791556728) internal successors, (988), 761 states have internal predecessors, (988), 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-20 03:22:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1002 transitions. [2022-03-20 03:22:38,570 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1002 transitions. Word has length 46 [2022-03-20 03:22:38,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:22:38,570 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 1002 transitions. [2022-03-20 03:22:38,570 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-20 03:22:38,570 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1002 transitions. [2022-03-20 03:22:38,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-20 03:22:38,571 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:22:38,571 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-20 03:22:38,607 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-20 03:22:38,808 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-20 03:22:38,808 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:22:38,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:22:38,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1478646395, now seen corresponding path program 4 times [2022-03-20 03:22:38,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:22:38,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338530695] [2022-03-20 03:22:38,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:22:38,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:22:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:22:38,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:22:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:22:38,889 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-20 03:22:38,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:22:38,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338530695] [2022-03-20 03:22:38,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338530695] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:22:38,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649299450] [2022-03-20 03:22:38,889 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 03:22:38,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:22:38,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:22:38,890 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-20 03:22:38,895 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-20 03:22:39,008 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 03:22:39,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 03:22:39,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 03:22:39,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:22:39,134 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-20 03:22:39,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:22:39,230 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-20 03:22:39,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649299450] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:22:39,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:22:39,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 18 [2022-03-20 03:22:39,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775545635] [2022-03-20 03:22:39,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:22:39,231 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-20 03:22:39,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:22:39,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-20 03:22:39,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-03-20 03:22:39,232 INFO L87 Difference]: Start difference. First operand 771 states and 1002 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-20 03:22:39,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:22:39,900 INFO L93 Difference]: Finished difference Result 1253 states and 1587 transitions. [2022-03-20 03:22:39,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-20 03:22:39,900 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-20 03:22:39,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:22:39,903 INFO L225 Difference]: With dead ends: 1253 [2022-03-20 03:22:39,903 INFO L226 Difference]: Without dead ends: 1253 [2022-03-20 03:22:39,904 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2022-03-20 03:22:39,904 INFO L913 BasicCegarLoop]: 101 mSDtfsCounter, 241 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-20 03:22:39,904 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 143 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-20 03:22:39,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2022-03-20 03:22:39,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 841. [2022-03-20 03:22:39,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 828 states have (on average 1.2971014492753623) internal successors, (1074), 831 states have internal predecessors, (1074), 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-20 03:22:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1088 transitions. [2022-03-20 03:22:39,916 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1088 transitions. Word has length 46 [2022-03-20 03:22:39,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:22:39,916 INFO L478 AbstractCegarLoop]: Abstraction has 841 states and 1088 transitions. [2022-03-20 03:22:39,916 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-20 03:22:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1088 transitions. [2022-03-20 03:22:39,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-03-20 03:22:39,918 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:22:39,918 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-20 03:22:39,937 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-20 03:22:40,135 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-20 03:22:40,135 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:22:40,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:22:40,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2086273551, now seen corresponding path program 1 times [2022-03-20 03:22:40,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:22:40,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911170779] [2022-03-20 03:22:40,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:22:40,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:22:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-20 03:22:40,182 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-20 03:22:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-20 03:22:40,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-20 03:22:40,219 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-03-20 03:22:40,220 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 03:22:40,221 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-20 03:22:40,223 INFO L719 BasicCegarLoop]: Path program histogram: [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 03:22:40,224 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 03:22:40,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 03:22:40 BasicIcfg [2022-03-20 03:22:40,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 03:22:40,262 INFO L158 Benchmark]: Toolchain (without parser) took 237400.28ms. Allocated memory was 166.7MB in the beginning and 310.4MB in the end (delta: 143.7MB). Free memory was 118.7MB in the beginning and 243.3MB in the end (delta: -124.6MB). Peak memory consumption was 20.1MB. Max. memory is 8.0GB. [2022-03-20 03:22:40,262 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 166.7MB. Free memory was 135.0MB in the beginning and 134.8MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 03:22:40,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.81ms. Allocated memory is still 166.7MB. Free memory was 118.4MB in the beginning and 142.5MB in the end (delta: -24.1MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2022-03-20 03:22:40,263 INFO L158 Benchmark]: Boogie Preprocessor took 28.11ms. Allocated memory is still 166.7MB. Free memory was 142.5MB in the beginning and 140.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-20 03:22:40,263 INFO L158 Benchmark]: RCFGBuilder took 348.22ms. Allocated memory is still 166.7MB. Free memory was 140.5MB in the beginning and 124.7MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-03-20 03:22:40,263 INFO L158 Benchmark]: IcfgTransformer took 28.52ms. Allocated memory is still 166.7MB. Free memory was 124.7MB in the beginning and 122.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-20 03:22:40,263 INFO L158 Benchmark]: TraceAbstraction took 236678.95ms. Allocated memory was 166.7MB in the beginning and 310.4MB in the end (delta: 143.7MB). Free memory was 122.1MB in the beginning and 243.3MB in the end (delta: -121.2MB). Peak memory consumption was 22.9MB. Max. memory is 8.0GB. [2022-03-20 03:22:40,263 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 166.7MB. Free memory was 135.0MB in the beginning and 134.8MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 311.81ms. Allocated memory is still 166.7MB. Free memory was 118.4MB in the beginning and 142.5MB in the end (delta: -24.1MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.11ms. Allocated memory is still 166.7MB. Free memory was 142.5MB in the beginning and 140.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 348.22ms. Allocated memory is still 166.7MB. Free memory was 140.5MB in the beginning and 124.7MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * IcfgTransformer took 28.52ms. Allocated memory is still 166.7MB. Free memory was 124.7MB in the beginning and 122.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 236678.95ms. Allocated memory was 166.7MB in the beginning and 310.4MB in the end (delta: 143.7MB). Free memory was 122.1MB in the beginning and 243.3MB in the end (delta: -121.2MB). Peak memory consumption was 22.9MB. 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=0, Source={22: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=0, Source={22: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={22:0}, source=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=0, Source={22: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={22:0}, source=0, Weight={25:0}] [L30] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=2, INFINITY=899, nodecount=2, Source={22:0}, source=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=0, Source={22: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=0, Source={22: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=0, Source={22: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={22:0}, source=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=0, Source={22: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={22:0}, source=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=0, Source={22: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={22:0}, source=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=0, Source={22: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={22:0}, source=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={22:0}, source=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={22:0}, source=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=0, Source={22: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=0, Source={22: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={22:0}, source=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=0, Source={22: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={22:0}, source=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 4 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 236.6s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 60.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4601 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4587 mSDsluCounter, 2433 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 6710 IncrementalHoareTripleChecker+Unchecked, 1405 mSDsCounter, 2367 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12855 IncrementalHoareTripleChecker+Invalid, 21932 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2367 mSolverCounterUnsat, 1028 mSDtfsCounter, 12855 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2342 GetRequests, 1202 SyntacticMatches, 64 SemanticMatches, 1076 ConstructedPredicates, 25 IntricatePredicates, 1 DeprecatedPredicates, 67453 ImplicationChecksByTransitivity, 196.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=841occurred in iteration=23, InterpolantAutomatonStates: 710, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 3618 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 169.0s 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-20 03:22:40,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...