/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/heap-manipulation/dancing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:49:08,468 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:49:08,470 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:49:08,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:49:08,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:49:08,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:49:08,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:49:08,527 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:49:08,529 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:49:08,530 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:49:08,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:49:08,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:49:08,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:49:08,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:49:08,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:49:08,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:49:08,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:49:08,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:49:08,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:49:08,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:49:08,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:49:08,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:49:08,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:49:08,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:49:08,551 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:49:08,551 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:49:08,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:49:08,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:49:08,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:49:08,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:49:08,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:49:08,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:49:08,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:49:08,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:49:08,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:49:08,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:49:08,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:49:08,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:49:08,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:49:08,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:49:08,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:49:08,562 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 00:49:08,598 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:49:08,598 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:49:08,598 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:49:08,598 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:49:08,599 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:49:08,599 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:49:08,599 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:49:08,599 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:49:08,599 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:49:08,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:49:08,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:49:08,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:49:08,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:49:08,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:49:08,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:49:08,600 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:49:08,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:49:08,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:49:08,600 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:49:08,600 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:49:08,600 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:49:08,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:49:08,601 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:49:08,601 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:49:08,601 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:49:08,601 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:49:08,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:49:08,601 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:49:08,601 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:49:08,601 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:49:08,601 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 00:49:08,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:49:08,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:49:08,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:49:08,793 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:49:08,793 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:49:08,794 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/dancing.i [2022-01-10 00:49:08,831 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3fa39898/615442e8ec9f4511a9777c28ad29da4b/FLAG50f3ccbff [2022-01-10 00:49:09,197 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:49:09,197 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dancing.i [2022-01-10 00:49:09,211 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3fa39898/615442e8ec9f4511a9777c28ad29da4b/FLAG50f3ccbff [2022-01-10 00:49:09,555 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3fa39898/615442e8ec9f4511a9777c28ad29da4b [2022-01-10 00:49:09,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:49:09,558 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:49:09,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:49:09,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:49:09,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:49:09,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:49:09" (1/1) ... [2022-01-10 00:49:09,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@305fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:09, skipping insertion in model container [2022-01-10 00:49:09,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:49:09" (1/1) ... [2022-01-10 00:49:09,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:49:09,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:49:09,727 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dancing.i[938,951] [2022-01-10 00:49:09,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:49:09,834 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:49:09,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dancing.i[938,951] [2022-01-10 00:49:09,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:49:09,884 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:49:09,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:09 WrapperNode [2022-01-10 00:49:09,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:49:09,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:49:09,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:49:09,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:49:09,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:09" (1/1) ... [2022-01-10 00:49:09,899 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:09" (1/1) ... [2022-01-10 00:49:09,931 INFO L137 Inliner]: procedures = 124, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2022-01-10 00:49:09,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:49:09,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:49:09,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:49:09,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:49:09,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:09" (1/1) ... [2022-01-10 00:49:09,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:09" (1/1) ... [2022-01-10 00:49:09,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:09" (1/1) ... [2022-01-10 00:49:09,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:09" (1/1) ... [2022-01-10 00:49:09,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:09" (1/1) ... [2022-01-10 00:49:09,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:09" (1/1) ... [2022-01-10 00:49:09,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:09" (1/1) ... [2022-01-10 00:49:09,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:49:09,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:49:09,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:49:09,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:49:09,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:09" (1/1) ... [2022-01-10 00:49:09,965 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:49:09,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:49:09,993 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-01-10 00:49:10,009 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-01-10 00:49:10,020 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2022-01-10 00:49:10,020 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2022-01-10 00:49:10,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-10 00:49:10,020 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-10 00:49:10,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 00:49:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:49:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 00:49:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 00:49:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 00:49:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 00:49:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:49:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:49:10,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:49:10,087 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:49:10,088 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:49:10,266 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:49:10,272 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:49:10,272 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 00:49:10,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:49:10 BoogieIcfgContainer [2022-01-10 00:49:10,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:49:10,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:49:10,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:49:10,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:49:10,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:49:09" (1/3) ... [2022-01-10 00:49:10,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a16399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:49:10, skipping insertion in model container [2022-01-10 00:49:10,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:09" (2/3) ... [2022-01-10 00:49:10,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a16399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:49:10, skipping insertion in model container [2022-01-10 00:49:10,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:49:10" (3/3) ... [2022-01-10 00:49:10,287 INFO L111 eAbstractionObserver]: Analyzing ICFG dancing.i [2022-01-10 00:49:10,291 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:49:10,291 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:49:10,329 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:49:10,334 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 00:49:10,335 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:49:10,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:49:10,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 00:49:10,348 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:10,349 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:10,349 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:10,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:10,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1472755522, now seen corresponding path program 1 times [2022-01-10 00:49:10,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:10,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478238654] [2022-01-10 00:49:10,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:10,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:10,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:49:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:10,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:10,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478238654] [2022-01-10 00:49:10,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478238654] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:49:10,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:49:10,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:49:10,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702079065] [2022-01-10 00:49:10,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:49:10,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 00:49:10,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:10,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 00:49:10,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 00:49:10,511 INFO L87 Difference]: Start difference. First operand has 41 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 00:49:10,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:10,533 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2022-01-10 00:49:10,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 00:49:10,534 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-01-10 00:49:10,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:10,540 INFO L225 Difference]: With dead ends: 77 [2022-01-10 00:49:10,540 INFO L226 Difference]: Without dead ends: 37 [2022-01-10 00:49:10,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 00:49:10,546 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:10,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:49:10,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-10 00:49:10,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-01-10 00:49:10,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 00:49:10,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2022-01-10 00:49:10,579 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 20 [2022-01-10 00:49:10,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:10,579 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2022-01-10 00:49:10,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 00:49:10,579 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2022-01-10 00:49:10,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 00:49:10,581 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:10,581 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:10,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:49:10,581 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:10,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:10,582 INFO L85 PathProgramCache]: Analyzing trace with hash -751028367, now seen corresponding path program 1 times [2022-01-10 00:49:10,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:10,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183959107] [2022-01-10 00:49:10,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:10,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:10,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:49:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:10,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:10,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:10,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183959107] [2022-01-10 00:49:10,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183959107] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:49:10,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:49:10,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 00:49:10,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161581763] [2022-01-10 00:49:10,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:49:10,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:49:10,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:10,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:49:10,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:49:10,725 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 00:49:10,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:10,765 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-01-10 00:49:10,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 00:49:10,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-01-10 00:49:10,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:10,767 INFO L225 Difference]: With dead ends: 45 [2022-01-10 00:49:10,767 INFO L226 Difference]: Without dead ends: 43 [2022-01-10 00:49:10,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:49:10,768 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:10,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 183 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:49:10,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-10 00:49:10,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-01-10 00:49:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 33 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:49:10,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2022-01-10 00:49:10,773 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 20 [2022-01-10 00:49:10,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:10,774 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2022-01-10 00:49:10,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 00:49:10,774 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2022-01-10 00:49:10,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 00:49:10,775 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:10,775 INFO L514 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] [2022-01-10 00:49:10,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:49:10,776 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:10,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:10,776 INFO L85 PathProgramCache]: Analyzing trace with hash 789210768, now seen corresponding path program 1 times [2022-01-10 00:49:10,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:10,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616247884] [2022-01-10 00:49:10,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:10,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:10,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:49:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:10,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 00:49:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:10,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 00:49:10,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:10,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616247884] [2022-01-10 00:49:10,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616247884] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:49:10,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:49:10,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 00:49:10,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318051288] [2022-01-10 00:49:10,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:49:10,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:49:10,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:10,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:49:10,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:49:10,875 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:49:10,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:10,902 INFO L93 Difference]: Finished difference Result 86 states and 116 transitions. [2022-01-10 00:49:10,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 00:49:10,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-01-10 00:49:10,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:10,903 INFO L225 Difference]: With dead ends: 86 [2022-01-10 00:49:10,903 INFO L226 Difference]: Without dead ends: 63 [2022-01-10 00:49:10,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-01-10 00:49:10,905 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 15 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:10,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 141 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:49:10,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-10 00:49:10,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2022-01-10 00:49:10,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.380952380952381) internal successors, (58), 44 states have internal predecessors, (58), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-10 00:49:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2022-01-10 00:49:10,912 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 26 [2022-01-10 00:49:10,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:10,912 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2022-01-10 00:49:10,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:49:10,912 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2022-01-10 00:49:10,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 00:49:10,913 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:10,913 INFO L514 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] [2022-01-10 00:49:10,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 00:49:10,914 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:10,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:10,914 INFO L85 PathProgramCache]: Analyzing trace with hash 860755832, now seen corresponding path program 1 times [2022-01-10 00:49:10,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:10,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889115189] [2022-01-10 00:49:10,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:10,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:11,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 00:49:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:11,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 00:49:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:49:11,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:11,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889115189] [2022-01-10 00:49:11,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889115189] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:49:11,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081566683] [2022-01-10 00:49:11,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:11,060 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:11,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:49:11,062 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-01-10 00:49:11,063 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-01-10 00:49:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:11,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 00:49:11,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:49:11,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:11,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:49:11,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:49:11,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081566683] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:49:11,482 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:49:11,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-01-10 00:49:11,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659136168] [2022-01-10 00:49:11,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:49:11,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 00:49:11,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:11,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 00:49:11,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-01-10 00:49:11,484 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-10 00:49:11,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:11,699 INFO L93 Difference]: Finished difference Result 118 states and 165 transitions. [2022-01-10 00:49:11,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 00:49:11,700 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-01-10 00:49:11,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:11,702 INFO L225 Difference]: With dead ends: 118 [2022-01-10 00:49:11,702 INFO L226 Difference]: Without dead ends: 82 [2022-01-10 00:49:11,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-01-10 00:49:11,703 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 132 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:11,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 366 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:49:11,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-01-10 00:49:11,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2022-01-10 00:49:11,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.375) internal successors, (66), 52 states have internal predecessors, (66), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2022-01-10 00:49:11,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2022-01-10 00:49:11,712 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 29 [2022-01-10 00:49:11,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:11,712 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2022-01-10 00:49:11,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-10 00:49:11,712 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2022-01-10 00:49:11,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 00:49:11,713 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:11,713 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:11,733 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-01-10 00:49:11,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:11,930 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:11,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:11,931 INFO L85 PathProgramCache]: Analyzing trace with hash 162961828, now seen corresponding path program 1 times [2022-01-10 00:49:11,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:11,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325994748] [2022-01-10 00:49:11,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:11,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:12,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 00:49:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:12,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 00:49:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:12,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 00:49:12,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:12,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325994748] [2022-01-10 00:49:12,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325994748] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:49:12,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:49:12,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 00:49:12,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203189298] [2022-01-10 00:49:12,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:49:12,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 00:49:12,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:12,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 00:49:12,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:49:12,054 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 00:49:12,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:12,111 INFO L93 Difference]: Finished difference Result 75 states and 105 transitions. [2022-01-10 00:49:12,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 00:49:12,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-01-10 00:49:12,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:12,113 INFO L225 Difference]: With dead ends: 75 [2022-01-10 00:49:12,113 INFO L226 Difference]: Without dead ends: 73 [2022-01-10 00:49:12,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 00:49:12,115 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 7 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:12,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 301 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:49:12,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-10 00:49:12,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-01-10 00:49:12,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 58 states have internal predecessors, (71), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2022-01-10 00:49:12,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2022-01-10 00:49:12,129 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 31 [2022-01-10 00:49:12,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:12,129 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2022-01-10 00:49:12,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 00:49:12,129 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2022-01-10 00:49:12,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 00:49:12,130 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:12,130 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2022-01-10 00:49:12,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 00:49:12,131 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:12,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:12,131 INFO L85 PathProgramCache]: Analyzing trace with hash 786337177, now seen corresponding path program 1 times [2022-01-10 00:49:12,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:12,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259215938] [2022-01-10 00:49:12,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:12,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:12,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 00:49:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:12,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 00:49:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:12,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:49:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:12,262 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 00:49:12,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:12,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259215938] [2022-01-10 00:49:12,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259215938] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:49:12,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944284113] [2022-01-10 00:49:12,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:12,263 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:12,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:49:12,265 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-01-10 00:49:12,266 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-01-10 00:49:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:12,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 50 conjunts are in the unsatisfiable core [2022-01-10 00:49:12,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:49:12,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:49:12,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 23 [2022-01-10 00:49:12,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:49:12,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 23 [2022-01-10 00:49:12,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:49:12,488 INFO L387 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 16 treesize of output 18 [2022-01-10 00:49:12,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:49:12,495 INFO L387 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 16 treesize of output 18 [2022-01-10 00:49:12,686 INFO L387 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-01-10 00:49:12,688 INFO L387 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-01-10 00:49:12,742 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 00:49:12,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:49:12,788 INFO L387 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 10 treesize of output 4 [2022-01-10 00:49:12,912 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-01-10 00:49:12,912 INFO L387 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2022-01-10 00:49:12,915 INFO L387 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 36 treesize of output 24 [2022-01-10 00:49:12,918 INFO L387 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 7 treesize of output 3 [2022-01-10 00:49:12,923 INFO L353 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2022-01-10 00:49:12,924 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2022-01-10 00:49:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 00:49:12,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944284113] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:49:12,947 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:49:12,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 16 [2022-01-10 00:49:12,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809514480] [2022-01-10 00:49:12,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:49:12,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 00:49:12,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:12,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 00:49:12,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-01-10 00:49:12,949 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-10 00:49:13,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:13,399 INFO L93 Difference]: Finished difference Result 269 states and 401 transitions. [2022-01-10 00:49:13,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 00:49:13,400 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 37 [2022-01-10 00:49:13,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:13,402 INFO L225 Difference]: With dead ends: 269 [2022-01-10 00:49:13,402 INFO L226 Difference]: Without dead ends: 198 [2022-01-10 00:49:13,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2022-01-10 00:49:13,404 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 193 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:13,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 935 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 327 Invalid, 0 Unknown, 55 Unchecked, 0.2s Time] [2022-01-10 00:49:13,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-01-10 00:49:13,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 90. [2022-01-10 00:49:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 74 states have internal predecessors, (92), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) [2022-01-10 00:49:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2022-01-10 00:49:13,418 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 37 [2022-01-10 00:49:13,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:13,418 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2022-01-10 00:49:13,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-10 00:49:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2022-01-10 00:49:13,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 00:49:13,426 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:13,426 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:13,456 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-01-10 00:49:13,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-10 00:49:13,640 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:13,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:13,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1693334873, now seen corresponding path program 1 times [2022-01-10 00:49:13,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:13,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202970779] [2022-01-10 00:49:13,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:13,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:13,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:49:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:13,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 00:49:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:13,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-10 00:49:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:13,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 00:49:13,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:13,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202970779] [2022-01-10 00:49:13,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202970779] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:49:13,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:49:13,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 00:49:13,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207456199] [2022-01-10 00:49:13,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:49:13,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:49:13,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:13,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:49:13,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:49:13,712 INFO L87 Difference]: Start difference. First operand 90 states and 125 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 00:49:13,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:13,786 INFO L93 Difference]: Finished difference Result 133 states and 181 transitions. [2022-01-10 00:49:13,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 00:49:13,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-01-10 00:49:13,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:13,787 INFO L225 Difference]: With dead ends: 133 [2022-01-10 00:49:13,788 INFO L226 Difference]: Without dead ends: 102 [2022-01-10 00:49:13,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:49:13,789 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 20 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:13,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 169 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:49:13,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-01-10 00:49:13,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2022-01-10 00:49:13,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.323943661971831) internal successors, (94), 76 states have internal predecessors, (94), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) [2022-01-10 00:49:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 127 transitions. [2022-01-10 00:49:13,812 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 127 transitions. Word has length 35 [2022-01-10 00:49:13,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:13,812 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 127 transitions. [2022-01-10 00:49:13,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 00:49:13,812 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 127 transitions. [2022-01-10 00:49:13,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 00:49:13,813 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:13,814 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:13,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 00:49:13,814 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:13,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:13,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1474480155, now seen corresponding path program 1 times [2022-01-10 00:49:13,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:13,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981109622] [2022-01-10 00:49:13,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:13,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:13,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:49:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:13,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 00:49:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:13,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-10 00:49:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 00:49:13,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:13,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981109622] [2022-01-10 00:49:13,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981109622] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:49:13,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:49:13,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 00:49:13,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722974522] [2022-01-10 00:49:13,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:49:13,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 00:49:13,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:13,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 00:49:13,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:49:13,887 INFO L87 Difference]: Start difference. First operand 92 states and 127 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 00:49:13,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:13,918 INFO L93 Difference]: Finished difference Result 99 states and 133 transitions. [2022-01-10 00:49:13,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 00:49:13,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-01-10 00:49:13,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:13,919 INFO L225 Difference]: With dead ends: 99 [2022-01-10 00:49:13,919 INFO L226 Difference]: Without dead ends: 92 [2022-01-10 00:49:13,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:49:13,919 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:13,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 243 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:49:13,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-01-10 00:49:13,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2022-01-10 00:49:13,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 66 states have internal predecessors, (84), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-01-10 00:49:13,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 109 transitions. [2022-01-10 00:49:13,926 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 109 transitions. Word has length 35 [2022-01-10 00:49:13,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:13,927 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 109 transitions. [2022-01-10 00:49:13,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 00:49:13,927 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 109 transitions. [2022-01-10 00:49:13,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 00:49:13,927 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:13,928 INFO L514 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, 1, 1] [2022-01-10 00:49:13,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 00:49:13,928 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:13,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:13,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1846747895, now seen corresponding path program 1 times [2022-01-10 00:49:13,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:13,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352408633] [2022-01-10 00:49:13,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:13,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:13,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:49:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:13,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 00:49:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:13,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-10 00:49:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:13,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:49:13,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:13,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352408633] [2022-01-10 00:49:13,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352408633] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:49:13,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:49:13,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 00:49:13,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508081131] [2022-01-10 00:49:13,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:49:13,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:49:13,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:13,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:49:13,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:49:13,979 INFO L87 Difference]: Start difference. First operand 80 states and 109 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 00:49:14,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:14,023 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2022-01-10 00:49:14,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 00:49:14,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-01-10 00:49:14,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:14,024 INFO L225 Difference]: With dead ends: 130 [2022-01-10 00:49:14,024 INFO L226 Difference]: Without dead ends: 62 [2022-01-10 00:49:14,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:49:14,025 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 16 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:14,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 147 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:49:14,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-10 00:49:14,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2022-01-10 00:49:14,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 48 states have internal predecessors, (60), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2022-01-10 00:49:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2022-01-10 00:49:14,038 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 36 [2022-01-10 00:49:14,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:14,039 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2022-01-10 00:49:14,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 00:49:14,039 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2022-01-10 00:49:14,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-10 00:49:14,062 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:14,062 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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] [2022-01-10 00:49:14,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 00:49:14,063 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:14,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:14,063 INFO L85 PathProgramCache]: Analyzing trace with hash -827934680, now seen corresponding path program 1 times [2022-01-10 00:49:14,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:14,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742423692] [2022-01-10 00:49:14,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:14,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:14,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:49:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:14,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:49:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:14,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-10 00:49:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:14,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:49:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:14,229 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 00:49:14,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:14,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742423692] [2022-01-10 00:49:14,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742423692] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:49:14,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953599816] [2022-01-10 00:49:14,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:14,230 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:14,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:49:14,231 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-01-10 00:49:14,294 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-01-10 00:49:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:14,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 41 conjunts are in the unsatisfiable core [2022-01-10 00:49:14,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:49:14,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-10 00:49:14,429 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 00:49:14,429 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-10 00:49:14,452 INFO L353 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-01-10 00:49:14,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 55 [2022-01-10 00:49:14,457 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-01-10 00:49:14,461 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-01-10 00:49:14,482 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:49:14,483 INFO L387 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2022-01-10 00:49:14,504 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 00:49:14,504 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2022-01-10 00:49:14,506 INFO L387 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 30 treesize of output 18 [2022-01-10 00:49:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 00:49:14,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:49:14,751 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:14,752 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 127 [2022-01-10 00:49:14,755 INFO L387 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 152 treesize of output 144 [2022-01-10 00:49:14,758 INFO L387 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 144 treesize of output 140 [2022-01-10 00:49:14,805 INFO L387 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 30 treesize of output 26 [2022-01-10 00:49:14,812 INFO L387 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 8 treesize of output 4 [2022-01-10 00:49:14,912 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-10 00:49:14,918 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 00:49:14,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953599816] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:49:14,918 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:49:14,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2022-01-10 00:49:14,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097703460] [2022-01-10 00:49:14,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:49:14,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-10 00:49:14,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:14,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-10 00:49:14,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-01-10 00:49:14,919 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 17 states have internal predecessors, (50), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-10 00:49:15,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:15,320 INFO L93 Difference]: Finished difference Result 172 states and 253 transitions. [2022-01-10 00:49:15,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 00:49:15,321 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 17 states have internal predecessors, (50), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 46 [2022-01-10 00:49:15,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:15,322 INFO L225 Difference]: With dead ends: 172 [2022-01-10 00:49:15,322 INFO L226 Difference]: Without dead ends: 131 [2022-01-10 00:49:15,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2022-01-10 00:49:15,323 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 123 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:15,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 544 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 465 Invalid, 0 Unknown, 92 Unchecked, 0.3s Time] [2022-01-10 00:49:15,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-01-10 00:49:15,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 86. [2022-01-10 00:49:15,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 69 states have internal predecessors, (88), 13 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (23), 12 states have call predecessors, (23), 12 states have call successors, (23) [2022-01-10 00:49:15,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 124 transitions. [2022-01-10 00:49:15,357 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 124 transitions. Word has length 46 [2022-01-10 00:49:15,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:15,357 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 124 transitions. [2022-01-10 00:49:15,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 17 states have internal predecessors, (50), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-10 00:49:15,358 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 124 transitions. [2022-01-10 00:49:15,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 00:49:15,358 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:15,358 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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-01-10 00:49:15,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 00:49:15,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:15,575 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:15,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:15,576 INFO L85 PathProgramCache]: Analyzing trace with hash 803799756, now seen corresponding path program 1 times [2022-01-10 00:49:15,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:15,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557390596] [2022-01-10 00:49:15,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:15,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:15,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 00:49:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:15,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:49:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:15,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-10 00:49:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:15,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:49:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 00:49:15,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:15,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557390596] [2022-01-10 00:49:15,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557390596] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:49:15,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098933446] [2022-01-10 00:49:15,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:15,871 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:15,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:49:15,872 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-01-10 00:49:15,904 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-01-10 00:49:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:15,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 94 conjunts are in the unsatisfiable core [2022-01-10 00:49:16,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:49:16,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:49:16,074 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-01-10 00:49:16,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:49:16,078 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-10 00:49:16,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:49:16,086 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-01-10 00:49:16,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:49:16,089 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-10 00:49:16,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:49:16,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:49:16,629 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:49:16,635 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-01-10 00:49:16,636 INFO L387 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 52 [2022-01-10 00:49:16,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:49:16,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 49 treesize of output 31 [2022-01-10 00:49:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 00:49:19,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:49:19,597 INFO L387 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 10 treesize of output 4 [2022-01-10 00:49:19,763 INFO L387 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 10 treesize of output 4 [2022-01-10 00:49:20,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:49:20,072 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:20,072 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 182 treesize of output 174 [2022-01-10 00:49:20,074 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:49:20,078 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:20,079 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 182 treesize of output 109 [2022-01-10 00:49:20,102 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:20,102 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 822 treesize of output 794 [2022-01-10 00:49:20,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:49:20,118 INFO L387 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 1036 treesize of output 974 [2022-01-10 00:49:20,135 INFO L387 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 966 treesize of output 940 [2022-01-10 00:49:20,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:49:20,158 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:20,158 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 1202 treesize of output 1068 [2022-01-10 00:49:20,968 INFO L387 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 8 treesize of output 4 [2022-01-10 00:49:21,011 INFO L387 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 8 treesize of output 4 [2022-01-10 00:49:21,020 INFO L387 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 8 treesize of output 4 [2022-01-10 00:49:21,032 INFO L387 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 8 treesize of output 4 [2022-01-10 00:49:21,053 INFO L387 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 8 treesize of output 4 [2022-01-10 00:49:21,434 INFO L387 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 8 treesize of output 4 [2022-01-10 00:49:21,443 INFO L387 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 8 treesize of output 4 [2022-01-10 00:49:21,462 INFO L387 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 8 treesize of output 4 [2022-01-10 00:49:21,886 INFO L387 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 8 treesize of output 4 [2022-01-10 00:49:21,902 INFO L387 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 30 treesize of output 26 [2022-01-10 00:49:21,954 INFO L387 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 8 treesize of output 4 [2022-01-10 00:49:21,966 INFO L387 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 30 treesize of output 26 [2022-01-10 00:49:22,947 INFO L353 Elim1Store]: treesize reduction 14, result has 57.6 percent of original size [2022-01-10 00:49:22,947 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 226 treesize of output 208 [2022-01-10 00:49:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 00:49:23,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098933446] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:49:23,378 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:49:23,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 42 [2022-01-10 00:49:23,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339281058] [2022-01-10 00:49:23,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:49:23,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-10 00:49:23,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:23,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-10 00:49:23,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1559, Unknown=6, NotChecked=0, Total=1722 [2022-01-10 00:49:23,380 INFO L87 Difference]: Start difference. First operand 86 states and 124 transitions. Second operand has 42 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 41 states have internal predecessors, (77), 11 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-10 00:49:27,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:27,616 INFO L93 Difference]: Finished difference Result 272 states and 405 transitions. [2022-01-10 00:49:27,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-10 00:49:27,616 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 41 states have internal predecessors, (77), 11 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Word has length 43 [2022-01-10 00:49:27,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:27,618 INFO L225 Difference]: With dead ends: 272 [2022-01-10 00:49:27,618 INFO L226 Difference]: Without dead ends: 199 [2022-01-10 00:49:27,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=481, Invalid=4065, Unknown=10, NotChecked=0, Total=4556 [2022-01-10 00:49:27,620 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 379 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 379 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:27,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 1429 Invalid, 2127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 1404 Invalid, 0 Unknown, 379 Unchecked, 1.1s Time] [2022-01-10 00:49:27,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-01-10 00:49:27,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 110. [2022-01-10 00:49:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 89 states have internal predecessors, (107), 16 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (30), 14 states have call predecessors, (30), 15 states have call successors, (30) [2022-01-10 00:49:27,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 153 transitions. [2022-01-10 00:49:27,641 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 153 transitions. Word has length 43 [2022-01-10 00:49:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:27,641 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 153 transitions. [2022-01-10 00:49:27,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 41 states have internal predecessors, (77), 11 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-10 00:49:27,642 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 153 transitions. [2022-01-10 00:49:27,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 00:49:27,643 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:27,643 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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] [2022-01-10 00:49:27,660 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-01-10 00:49:27,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:27,860 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:27,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:27,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1251374562, now seen corresponding path program 1 times [2022-01-10 00:49:27,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:27,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795122851] [2022-01-10 00:49:27,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:27,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:27,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 00:49:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:27,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:49:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:27,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-10 00:49:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:27,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:49:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:27,929 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-10 00:49:27,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:27,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795122851] [2022-01-10 00:49:27,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795122851] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:49:27,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:49:27,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 00:49:27,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440318384] [2022-01-10 00:49:27,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:49:27,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 00:49:27,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:27,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 00:49:27,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 00:49:27,931 INFO L87 Difference]: Start difference. First operand 110 states and 153 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 00:49:27,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:27,974 INFO L93 Difference]: Finished difference Result 134 states and 189 transitions. [2022-01-10 00:49:27,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 00:49:27,975 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-01-10 00:49:27,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:27,976 INFO L225 Difference]: With dead ends: 134 [2022-01-10 00:49:27,976 INFO L226 Difference]: Without dead ends: 132 [2022-01-10 00:49:27,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-10 00:49:27,977 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 7 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:27,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 345 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:49:27,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-01-10 00:49:27,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 113. [2022-01-10 00:49:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 91 states have internal predecessors, (109), 16 states have call successors, (16), 6 states have call predecessors, (16), 12 states have return successors, (39), 15 states have call predecessors, (39), 15 states have call successors, (39) [2022-01-10 00:49:27,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 164 transitions. [2022-01-10 00:49:27,992 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 164 transitions. Word has length 44 [2022-01-10 00:49:27,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:27,992 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 164 transitions. [2022-01-10 00:49:27,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 00:49:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 164 transitions. [2022-01-10 00:49:27,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 00:49:27,993 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:27,993 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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-01-10 00:49:27,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 00:49:27,994 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:27,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:27,994 INFO L85 PathProgramCache]: Analyzing trace with hash -13848694, now seen corresponding path program 1 times [2022-01-10 00:49:27,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:27,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924999705] [2022-01-10 00:49:27,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:27,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:28,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 00:49:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:28,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:49:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:28,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-10 00:49:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:28,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:49:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:28,103 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-10 00:49:28,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:28,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924999705] [2022-01-10 00:49:28,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924999705] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:49:28,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967834957] [2022-01-10 00:49:28,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:28,104 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:28,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:49:28,120 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-01-10 00:49:28,144 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-01-10 00:49:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:28,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-10 00:49:28,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:49:28,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:49:28,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 23 [2022-01-10 00:49:28,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:49:28,296 INFO L387 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 14 treesize of output 16 [2022-01-10 00:49:28,497 INFO L387 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 24 treesize of output 12 [2022-01-10 00:49:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 00:49:28,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:49:28,680 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-01-10 00:49:28,680 INFO L387 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-01-10 00:49:28,683 INFO L387 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 30 treesize of output 22 [2022-01-10 00:49:28,685 INFO L387 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 9 treesize of output 7 [2022-01-10 00:49:28,742 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-10 00:49:28,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967834957] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:49:28,742 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:49:28,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 24 [2022-01-10 00:49:28,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861844358] [2022-01-10 00:49:28,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:49:28,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-10 00:49:28,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:28,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-10 00:49:28,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2022-01-10 00:49:28,744 INFO L87 Difference]: Start difference. First operand 113 states and 164 transitions. Second operand has 24 states, 24 states have (on average 2.5) internal successors, (60), 24 states have internal predecessors, (60), 6 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-01-10 00:49:29,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:29,405 INFO L93 Difference]: Finished difference Result 224 states and 331 transitions. [2022-01-10 00:49:29,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 00:49:29,405 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5) internal successors, (60), 24 states have internal predecessors, (60), 6 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 43 [2022-01-10 00:49:29,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:29,406 INFO L225 Difference]: With dead ends: 224 [2022-01-10 00:49:29,406 INFO L226 Difference]: Without dead ends: 168 [2022-01-10 00:49:29,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=1113, Unknown=0, NotChecked=0, Total=1406 [2022-01-10 00:49:29,407 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 325 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:29,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [328 Valid, 949 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 450 Invalid, 0 Unknown, 50 Unchecked, 0.2s Time] [2022-01-10 00:49:29,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-01-10 00:49:29,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 143. [2022-01-10 00:49:29,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 106 states have (on average 1.2641509433962264) internal successors, (134), 113 states have internal predecessors, (134), 22 states have call successors, (22), 9 states have call predecessors, (22), 14 states have return successors, (49), 20 states have call predecessors, (49), 20 states have call successors, (49) [2022-01-10 00:49:29,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 205 transitions. [2022-01-10 00:49:29,419 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 205 transitions. Word has length 43 [2022-01-10 00:49:29,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:29,419 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 205 transitions. [2022-01-10 00:49:29,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5) internal successors, (60), 24 states have internal predecessors, (60), 6 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-01-10 00:49:29,419 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 205 transitions. [2022-01-10 00:49:29,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 00:49:29,420 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:29,420 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:29,443 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-01-10 00:49:29,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-10 00:49:29,620 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:29,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:29,621 INFO L85 PathProgramCache]: Analyzing trace with hash -876464951, now seen corresponding path program 2 times [2022-01-10 00:49:29,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:29,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994014195] [2022-01-10 00:49:29,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:29,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:29,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 00:49:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:29,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:49:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:29,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-10 00:49:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:29,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:49:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:29,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:49:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:29,925 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-01-10 00:49:29,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:29,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994014195] [2022-01-10 00:49:29,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994014195] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:49:29,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504120830] [2022-01-10 00:49:29,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 00:49:29,925 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:29,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:49:29,926 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-01-10 00:49:29,927 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-01-10 00:49:30,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 00:49:30,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 00:49:30,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 70 conjunts are in the unsatisfiable core [2022-01-10 00:49:30,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:49:30,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-10 00:49:30,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:49:30,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 23 [2022-01-10 00:49:30,124 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 00:49:30,124 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-01-10 00:49:30,127 INFO L387 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 7 treesize of output 3 [2022-01-10 00:49:30,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:49:30,156 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 23 [2022-01-10 00:49:30,166 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 00:49:30,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-01-10 00:49:30,171 INFO L387 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 7 treesize of output 3 [2022-01-10 00:49:30,293 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 00:49:30,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-10 00:49:30,351 INFO L353 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-01-10 00:49:30,351 INFO L387 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 2 case distinctions, treesize of input 23 treesize of output 35 [2022-01-10 00:49:30,369 INFO L353 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-01-10 00:49:30,369 INFO L387 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 2 case distinctions, treesize of input 23 treesize of output 35 [2022-01-10 00:49:30,442 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 00:49:30,442 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-10 00:49:30,492 INFO L353 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-01-10 00:49:30,492 INFO L387 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 2 case distinctions, treesize of input 23 treesize of output 35 [2022-01-10 00:49:30,509 INFO L353 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-01-10 00:49:30,510 INFO L387 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 2 case distinctions, treesize of input 23 treesize of output 35 [2022-01-10 00:49:30,640 INFO L387 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 23 treesize of output 11 [2022-01-10 00:49:30,646 INFO L387 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 23 treesize of output 11 [2022-01-10 00:49:30,751 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 32 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-10 00:49:30,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:49:30,835 INFO L387 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 10 treesize of output 4 [2022-01-10 00:49:31,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:49:31,579 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:31,579 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 81 [2022-01-10 00:49:31,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:49:31,588 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:31,588 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 86 [2022-01-10 00:49:31,593 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:49:31,594 INFO L387 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 4420 treesize of output 4362 [2022-01-10 00:49:31,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:49:31,615 INFO L387 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 8696 treesize of output 8638 [2022-01-10 00:49:31,649 INFO L387 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 8638 treesize of output 8606 [2022-01-10 00:49:31,682 INFO L387 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 8606 treesize of output 8574 [2022-01-10 00:49:31,956 INFO L387 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 8157 treesize of output 7645 [2022-01-10 00:49:32,006 INFO L387 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 7645 treesize of output 7389 [2022-01-10 00:49:32,036 INFO L387 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 7389 treesize of output 7325 [2022-01-10 00:49:32,064 INFO L387 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 7325 treesize of output 7197 [2022-01-10 00:49:32,091 INFO L387 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 7197 treesize of output 6949 [2022-01-10 00:49:32,119 INFO L387 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 6949 treesize of output 6829 [2022-01-10 00:49:32,147 INFO L387 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 6829 treesize of output 6365 [2022-01-10 00:49:32,174 INFO L387 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 6365 treesize of output 6301 [2022-01-10 00:49:32,221 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-10 00:49:32,251 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-01-10 00:49:32,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:32,436 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-10 00:49:32,439 INFO L158 Benchmark]: Toolchain (without parser) took 22881.16ms. Allocated memory was 224.4MB in the beginning and 520.1MB in the end (delta: 295.7MB). Free memory was 168.3MB in the beginning and 475.4MB in the end (delta: -307.1MB). Peak memory consumption was 281.2MB. Max. memory is 8.0GB. [2022-01-10 00:49:32,439 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 224.4MB. Free memory is still 186.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 00:49:32,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.64ms. Allocated memory was 224.4MB in the beginning and 278.9MB in the end (delta: 54.5MB). Free memory was 168.1MB in the beginning and 245.8MB in the end (delta: -77.6MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2022-01-10 00:49:32,442 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.73ms. Allocated memory is still 278.9MB. Free memory was 245.8MB in the beginning and 243.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 00:49:32,442 INFO L158 Benchmark]: Boogie Preprocessor took 23.33ms. Allocated memory is still 278.9MB. Free memory was 243.7MB in the beginning and 241.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 00:49:32,442 INFO L158 Benchmark]: RCFGBuilder took 317.97ms. Allocated memory is still 278.9MB. Free memory was 241.9MB in the beginning and 227.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-01-10 00:49:32,443 INFO L158 Benchmark]: TraceAbstraction took 22163.59ms. Allocated memory was 278.9MB in the beginning and 520.1MB in the end (delta: 241.2MB). Free memory was 226.5MB in the beginning and 475.4MB in the end (delta: -248.9MB). Peak memory consumption was 284.7MB. Max. memory is 8.0GB. [2022-01-10 00:49:32,444 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 224.4MB. Free memory is still 186.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 323.64ms. Allocated memory was 224.4MB in the beginning and 278.9MB in the end (delta: 54.5MB). Free memory was 168.1MB in the beginning and 245.8MB in the end (delta: -77.6MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.73ms. Allocated memory is still 278.9MB. Free memory was 245.8MB in the beginning and 243.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.33ms. Allocated memory is still 278.9MB. Free memory was 243.7MB in the beginning and 241.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 317.97ms. Allocated memory is still 278.9MB. Free memory was 241.9MB in the beginning and 227.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 22163.59ms. Allocated memory was 278.9MB in the beginning and 520.1MB in the end (delta: 241.2MB). Free memory was 226.5MB in the beginning and 475.4MB in the end (delta: -248.9MB). Peak memory consumption was 284.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-10 00:49:32,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...