/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-820ea7a [2022-02-18 14:46:02,170 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-18 14:46:02,172 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-18 14:46:02,217 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-18 14:46:02,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-18 14:46:02,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-18 14:46:02,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-18 14:46:02,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-18 14:46:02,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-18 14:46:02,222 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-18 14:46:02,223 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-18 14:46:02,224 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-18 14:46:02,224 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-18 14:46:02,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-18 14:46:02,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-18 14:46:02,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-18 14:46:02,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-18 14:46:02,235 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-18 14:46:02,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-18 14:46:02,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-18 14:46:02,247 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-18 14:46:02,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-18 14:46:02,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-18 14:46:02,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-18 14:46:02,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-18 14:46:02,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-18 14:46:02,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-18 14:46:02,253 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-18 14:46:02,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-18 14:46:02,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-18 14:46:02,254 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-18 14:46:02,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-18 14:46:02,255 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-18 14:46:02,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-18 14:46:02,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-18 14:46:02,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-18 14:46:02,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-18 14:46:02,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-18 14:46:02,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-18 14:46:02,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-18 14:46:02,258 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-18 14:46:02,264 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-02-18 14:46:02,287 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-18 14:46:02,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-18 14:46:02,287 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-18 14:46:02,287 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-18 14:46:02,288 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-18 14:46:02,288 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-18 14:46:02,288 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-18 14:46:02,288 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-18 14:46:02,289 INFO L138 SettingsManager]: * Use SBE=true [2022-02-18 14:46:02,289 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-18 14:46:02,289 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-18 14:46:02,289 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-18 14:46:02,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-18 14:46:02,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-18 14:46:02,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-18 14:46:02,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-18 14:46:02,289 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-18 14:46:02,289 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-18 14:46:02,290 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-18 14:46:02,290 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-18 14:46:02,290 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-18 14:46:02,290 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-18 14:46:02,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-18 14:46:02,290 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-18 14:46:02,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-18 14:46:02,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-18 14:46:02,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-18 14:46:02,291 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-18 14:46:02,291 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-18 14:46:02,291 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-18 14:46:02,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-18 14:46:02,293 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-18 14:46:02,293 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-18 14:46:02,293 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-02-18 14:46:02,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-18 14:46:02,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-18 14:46:02,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-18 14:46:02,490 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-18 14:46:02,500 INFO L275 PluginConnector]: CDTParser initialized [2022-02-18 14:46:02,501 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2022-02-18 14:46:02,560 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/571ba813c/4674867aca45489e8ad96ab5f2a40c03/FLAG16f81cb05 [2022-02-18 14:46:02,898 INFO L306 CDTParser]: Found 1 translation units. [2022-02-18 14:46:02,899 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2022-02-18 14:46:02,903 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/571ba813c/4674867aca45489e8ad96ab5f2a40c03/FLAG16f81cb05 [2022-02-18 14:46:02,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/571ba813c/4674867aca45489e8ad96ab5f2a40c03 [2022-02-18 14:46:02,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-18 14:46:02,918 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-18 14:46:02,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-18 14:46:02,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-18 14:46:02,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-18 14:46:02,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 02:46:02" (1/1) ... [2022-02-18 14:46:02,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fd37dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:46:02, skipping insertion in model container [2022-02-18 14:46:02,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 02:46:02" (1/1) ... [2022-02-18 14:46:02,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-18 14:46:02,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-18 14:46:03,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c[2870,2883] [2022-02-18 14:46:03,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-18 14:46:03,095 INFO L203 MainTranslator]: Completed pre-run [2022-02-18 14:46:03,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c[2870,2883] [2022-02-18 14:46:03,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-18 14:46:03,120 INFO L208 MainTranslator]: Completed translation [2022-02-18 14:46:03,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:46:03 WrapperNode [2022-02-18 14:46:03,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-18 14:46:03,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-18 14:46:03,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-18 14:46:03,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-18 14:46:03,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:46:03" (1/1) ... [2022-02-18 14:46:03,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:46:03" (1/1) ... [2022-02-18 14:46:03,148 INFO L137 Inliner]: procedures = 25, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 163 [2022-02-18 14:46:03,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-18 14:46:03,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-18 14:46:03,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-18 14:46:03,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-18 14:46:03,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:46:03" (1/1) ... [2022-02-18 14:46:03,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:46:03" (1/1) ... [2022-02-18 14:46:03,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:46:03" (1/1) ... [2022-02-18 14:46:03,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:46:03" (1/1) ... [2022-02-18 14:46:03,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:46:03" (1/1) ... [2022-02-18 14:46:03,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:46:03" (1/1) ... [2022-02-18 14:46:03,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:46:03" (1/1) ... [2022-02-18 14:46:03,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-18 14:46:03,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-18 14:46:03,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-18 14:46:03,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-18 14:46:03,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:46:03" (1/1) ... [2022-02-18 14:46:03,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-18 14:46:03,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:46:03,211 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-02-18 14:46:03,217 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-02-18 14:46:03,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-18 14:46:03,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-18 14:46:03,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-18 14:46:03,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-18 14:46:03,243 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-02-18 14:46:03,244 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-02-18 14:46:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-02-18 14:46:03,244 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-02-18 14:46:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-18 14:46:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-18 14:46:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-18 14:46:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-18 14:46:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-18 14:46:03,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-18 14:46:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-18 14:46:03,245 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-18 14:46:03,299 INFO L234 CfgBuilder]: Building ICFG [2022-02-18 14:46:03,300 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-18 14:46:03,538 INFO L275 CfgBuilder]: Performing block encoding [2022-02-18 14:46:03,601 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-18 14:46:03,603 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-18 14:46:03,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 02:46:03 BoogieIcfgContainer [2022-02-18 14:46:03,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-18 14:46:03,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-18 14:46:03,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-18 14:46:03,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-18 14:46:03,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 02:46:02" (1/3) ... [2022-02-18 14:46:03,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26d60caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 02:46:03, skipping insertion in model container [2022-02-18 14:46:03,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:46:03" (2/3) ... [2022-02-18 14:46:03,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26d60caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 02:46:03, skipping insertion in model container [2022-02-18 14:46:03,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 02:46:03" (3/3) ... [2022-02-18 14:46:03,610 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-2-nl.wvr.c [2022-02-18 14:46:03,613 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-18 14:46:03,613 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-18 14:46:03,613 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-18 14:46:03,613 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-18 14:46:03,642 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,643 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,643 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,643 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,643 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,643 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,644 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,644 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,644 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,644 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,644 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,644 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,645 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,645 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,645 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,645 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,645 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,645 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,646 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,646 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,646 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,646 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,646 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,646 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,646 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,647 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,647 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,647 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,647 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,647 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,647 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,647 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,647 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,648 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,648 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,648 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,648 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,648 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,648 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,648 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,649 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,649 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,649 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,649 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,649 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,649 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,649 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,650 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,650 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,650 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,650 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,650 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,650 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,650 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,651 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,651 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,651 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,651 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,654 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,654 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,654 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,654 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,654 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,655 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,655 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,655 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,655 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,655 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,656 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,656 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,656 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,656 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,656 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,656 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,656 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:46:03,658 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-02-18 14:46:03,697 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-18 14:46:03,703 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=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, 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, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-02-18 14:46:03,703 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-18 14:46:03,713 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141 places, 145 transitions, 306 flow [2022-02-18 14:46:03,770 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 673 states, 672 states have (on average 2.6324404761904763) internal successors, (1769), 672 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:03,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 673 states, 672 states have (on average 2.6324404761904763) internal successors, (1769), 672 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:03,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-02-18 14:46:03,786 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:46:03,787 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:46:03,787 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:46:03,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:46:03,791 INFO L85 PathProgramCache]: Analyzing trace with hash -27169455, now seen corresponding path program 1 times [2022-02-18 14:46:03,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:46:03,797 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786778299] [2022-02-18 14:46:03,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:46:03,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:46:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:46:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:46:03,954 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:46:03,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786778299] [2022-02-18 14:46:03,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786778299] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 14:46:03,955 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 14:46:03,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-18 14:46:03,956 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648646173] [2022-02-18 14:46:03,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 14:46:03,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-18 14:46:03,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:46:03,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-18 14:46:03,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-18 14:46:03,980 INFO L87 Difference]: Start difference. First operand has 673 states, 672 states have (on average 2.6324404761904763) internal successors, (1769), 672 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:04,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:46:04,027 INFO L93 Difference]: Finished difference Result 673 states and 1616 transitions. [2022-02-18 14:46:04,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-18 14:46:04,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2022-02-18 14:46:04,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:46:04,041 INFO L225 Difference]: With dead ends: 673 [2022-02-18 14:46:04,041 INFO L226 Difference]: Without dead ends: 669 [2022-02-18 14:46:04,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-02-18 14:46:04,045 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-18 14:46:04,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-18 14:46:04,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-02-18 14:46:04,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 669. [2022-02-18 14:46:04,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 668 states have (on average 2.413173652694611) internal successors, (1612), 668 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:04,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1612 transitions. [2022-02-18 14:46:04,113 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1612 transitions. Word has length 104 [2022-02-18 14:46:04,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:46:04,114 INFO L470 AbstractCegarLoop]: Abstraction has 669 states and 1612 transitions. [2022-02-18 14:46:04,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:04,114 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1612 transitions. [2022-02-18 14:46:04,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-02-18 14:46:04,118 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:46:04,118 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-18 14:46:04,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-18 14:46:04,119 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:46:04,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:46:04,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1160132223, now seen corresponding path program 1 times [2022-02-18 14:46:04,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:46:04,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090132267] [2022-02-18 14:46:04,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:46:04,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:46:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:46:04,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:46:04,292 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:46:04,292 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090132267] [2022-02-18 14:46:04,293 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090132267] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 14:46:04,293 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 14:46:04,293 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-18 14:46:04,293 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963027950] [2022-02-18 14:46:04,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 14:46:04,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-18 14:46:04,294 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:46:04,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-18 14:46:04,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-18 14:46:04,295 INFO L87 Difference]: Start difference. First operand 669 states and 1612 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:04,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:46:04,395 INFO L93 Difference]: Finished difference Result 778 states and 1820 transitions. [2022-02-18 14:46:04,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-18 14:46:04,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-02-18 14:46:04,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:46:04,399 INFO L225 Difference]: With dead ends: 778 [2022-02-18 14:46:04,399 INFO L226 Difference]: Without dead ends: 675 [2022-02-18 14:46:04,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-18 14:46:04,400 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 278 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 14:46:04,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 329 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 14:46:04,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-02-18 14:46:04,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 670. [2022-02-18 14:46:04,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 669 states have (on average 2.411061285500747) internal successors, (1613), 669 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:04,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1613 transitions. [2022-02-18 14:46:04,432 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1613 transitions. Word has length 108 [2022-02-18 14:46:04,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:46:04,432 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 1613 transitions. [2022-02-18 14:46:04,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1613 transitions. [2022-02-18 14:46:04,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-02-18 14:46:04,435 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:46:04,435 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:46:04,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-18 14:46:04,436 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:46:04,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:46:04,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1866616762, now seen corresponding path program 1 times [2022-02-18 14:46:04,436 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:46:04,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661240787] [2022-02-18 14:46:04,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:46:04,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:46:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:46:04,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-18 14:46:04,587 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:46:04,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661240787] [2022-02-18 14:46:04,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661240787] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 14:46:04,587 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 14:46:04,587 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-18 14:46:04,587 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153149926] [2022-02-18 14:46:04,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 14:46:04,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-18 14:46:04,588 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:46:04,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-18 14:46:04,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-18 14:46:04,588 INFO L87 Difference]: Start difference. First operand 670 states and 1613 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:04,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:46:04,606 INFO L93 Difference]: Finished difference Result 712 states and 1721 transitions. [2022-02-18 14:46:04,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 14:46:04,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2022-02-18 14:46:04,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:46:04,609 INFO L225 Difference]: With dead ends: 712 [2022-02-18 14:46:04,609 INFO L226 Difference]: Without dead ends: 712 [2022-02-18 14:46:04,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-18 14:46:04,610 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-18 14:46:04,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 182 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-18 14:46:04,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-02-18 14:46:04,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712. [2022-02-18 14:46:04,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 711 states have (on average 2.420534458509142) internal successors, (1721), 711 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:04,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1721 transitions. [2022-02-18 14:46:04,627 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1721 transitions. Word has length 115 [2022-02-18 14:46:04,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:46:04,629 INFO L470 AbstractCegarLoop]: Abstraction has 712 states and 1721 transitions. [2022-02-18 14:46:04,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:04,630 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1721 transitions. [2022-02-18 14:46:04,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-02-18 14:46:04,635 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:46:04,635 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:46:04,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-18 14:46:04,636 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:46:04,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:46:04,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1016891364, now seen corresponding path program 2 times [2022-02-18 14:46:04,636 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:46:04,637 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531159490] [2022-02-18 14:46:04,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:46:04,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:46:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:46:05,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-18 14:46:05,276 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:46:05,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531159490] [2022-02-18 14:46:05,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531159490] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 14:46:05,276 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 14:46:05,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-18 14:46:05,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42768137] [2022-02-18 14:46:05,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 14:46:05,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-18 14:46:05,279 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:46:05,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-18 14:46:05,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-02-18 14:46:05,280 INFO L87 Difference]: Start difference. First operand 712 states and 1721 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:05,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:46:05,569 INFO L93 Difference]: Finished difference Result 1064 states and 2599 transitions. [2022-02-18 14:46:05,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-18 14:46:05,570 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2022-02-18 14:46:05,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:46:05,577 INFO L225 Difference]: With dead ends: 1064 [2022-02-18 14:46:05,577 INFO L226 Difference]: Without dead ends: 1013 [2022-02-18 14:46:05,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2022-02-18 14:46:05,583 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 203 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-18 14:46:05,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 1237 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-18 14:46:05,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2022-02-18 14:46:05,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 774. [2022-02-18 14:46:05,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 773 states have (on average 2.4307891332470892) internal successors, (1879), 773 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1879 transitions. [2022-02-18 14:46:05,614 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1879 transitions. Word has length 115 [2022-02-18 14:46:05,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:46:05,615 INFO L470 AbstractCegarLoop]: Abstraction has 774 states and 1879 transitions. [2022-02-18 14:46:05,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:05,615 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1879 transitions. [2022-02-18 14:46:05,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-02-18 14:46:05,617 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:46:05,617 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:46:05,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-18 14:46:05,617 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:46:05,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:46:05,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1424716348, now seen corresponding path program 3 times [2022-02-18 14:46:05,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:46:05,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882594666] [2022-02-18 14:46:05,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:46:05,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:46:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:46:06,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-18 14:46:06,021 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:46:06,021 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882594666] [2022-02-18 14:46:06,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882594666] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 14:46:06,021 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 14:46:06,021 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-18 14:46:06,022 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000538845] [2022-02-18 14:46:06,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 14:46:06,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-18 14:46:06,023 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:46:06,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-18 14:46:06,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-02-18 14:46:06,024 INFO L87 Difference]: Start difference. First operand 774 states and 1879 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:06,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:46:06,307 INFO L93 Difference]: Finished difference Result 1112 states and 2694 transitions. [2022-02-18 14:46:06,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-18 14:46:06,307 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2022-02-18 14:46:06,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:46:06,311 INFO L225 Difference]: With dead ends: 1112 [2022-02-18 14:46:06,312 INFO L226 Difference]: Without dead ends: 1061 [2022-02-18 14:46:06,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-02-18 14:46:06,312 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 199 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-18 14:46:06,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 1514 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-18 14:46:06,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2022-02-18 14:46:06,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 778. [2022-02-18 14:46:06,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 2.4375804375804377) internal successors, (1894), 777 states have internal predecessors, (1894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:06,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1894 transitions. [2022-02-18 14:46:06,330 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1894 transitions. Word has length 115 [2022-02-18 14:46:06,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:46:06,330 INFO L470 AbstractCegarLoop]: Abstraction has 778 states and 1894 transitions. [2022-02-18 14:46:06,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:06,330 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1894 transitions. [2022-02-18 14:46:06,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-02-18 14:46:06,332 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:46:06,332 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:46:06,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-18 14:46:06,332 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:46:06,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:46:06,333 INFO L85 PathProgramCache]: Analyzing trace with hash 122927162, now seen corresponding path program 4 times [2022-02-18 14:46:06,333 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:46:06,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980704126] [2022-02-18 14:46:06,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:46:06,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:46:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:46:06,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-18 14:46:06,654 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:46:06,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980704126] [2022-02-18 14:46:06,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980704126] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 14:46:06,654 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 14:46:06,655 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-18 14:46:06,655 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402886930] [2022-02-18 14:46:06,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 14:46:06,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-18 14:46:06,655 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:46:06,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-18 14:46:06,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-02-18 14:46:06,656 INFO L87 Difference]: Start difference. First operand 778 states and 1894 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:06,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:46:06,856 INFO L93 Difference]: Finished difference Result 1013 states and 2475 transitions. [2022-02-18 14:46:06,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-18 14:46:06,857 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2022-02-18 14:46:06,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:46:06,861 INFO L225 Difference]: With dead ends: 1013 [2022-02-18 14:46:06,861 INFO L226 Difference]: Without dead ends: 950 [2022-02-18 14:46:06,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2022-02-18 14:46:06,862 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 184 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 14:46:06,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 1123 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 14:46:06,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2022-02-18 14:46:06,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 778. [2022-02-18 14:46:06,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 2.4324324324324325) internal successors, (1890), 777 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:06,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1890 transitions. [2022-02-18 14:46:06,881 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1890 transitions. Word has length 115 [2022-02-18 14:46:06,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:46:06,881 INFO L470 AbstractCegarLoop]: Abstraction has 778 states and 1890 transitions. [2022-02-18 14:46:06,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:06,882 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1890 transitions. [2022-02-18 14:46:06,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-02-18 14:46:06,892 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:46:06,892 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:46:06,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-18 14:46:06,893 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:46:06,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:46:06,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1038328538, now seen corresponding path program 5 times [2022-02-18 14:46:06,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:46:06,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447999597] [2022-02-18 14:46:06,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:46:06,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:46:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:46:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-18 14:46:07,213 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:46:07,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447999597] [2022-02-18 14:46:07,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447999597] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 14:46:07,214 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 14:46:07,214 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-18 14:46:07,214 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741070790] [2022-02-18 14:46:07,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 14:46:07,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-18 14:46:07,214 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:46:07,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-18 14:46:07,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-02-18 14:46:07,215 INFO L87 Difference]: Start difference. First operand 778 states and 1890 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:07,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:46:07,481 INFO L93 Difference]: Finished difference Result 1113 states and 2715 transitions. [2022-02-18 14:46:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-18 14:46:07,482 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2022-02-18 14:46:07,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:46:07,485 INFO L225 Difference]: With dead ends: 1113 [2022-02-18 14:46:07,485 INFO L226 Difference]: Without dead ends: 1062 [2022-02-18 14:46:07,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2022-02-18 14:46:07,486 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 200 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-18 14:46:07,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 1364 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-18 14:46:07,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2022-02-18 14:46:07,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 823. [2022-02-18 14:46:07,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 822 states have (on average 2.427007299270073) internal successors, (1995), 822 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:07,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1995 transitions. [2022-02-18 14:46:07,502 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1995 transitions. Word has length 115 [2022-02-18 14:46:07,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:46:07,502 INFO L470 AbstractCegarLoop]: Abstraction has 823 states and 1995 transitions. [2022-02-18 14:46:07,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:07,503 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1995 transitions. [2022-02-18 14:46:07,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-02-18 14:46:07,504 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:46:07,504 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:46:07,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-18 14:46:07,505 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:46:07,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:46:07,507 INFO L85 PathProgramCache]: Analyzing trace with hash 892649658, now seen corresponding path program 6 times [2022-02-18 14:46:07,507 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:46:07,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106128639] [2022-02-18 14:46:07,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:46:07,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:46:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:46:07,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-18 14:46:07,832 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:46:07,832 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106128639] [2022-02-18 14:46:07,832 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106128639] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 14:46:07,832 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 14:46:07,832 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-18 14:46:07,832 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643500937] [2022-02-18 14:46:07,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 14:46:07,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-18 14:46:07,832 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:46:07,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-18 14:46:07,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-02-18 14:46:07,833 INFO L87 Difference]: Start difference. First operand 823 states and 1995 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:08,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:46:08,162 INFO L93 Difference]: Finished difference Result 1235 states and 2985 transitions. [2022-02-18 14:46:08,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-18 14:46:08,163 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2022-02-18 14:46:08,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:46:08,167 INFO L225 Difference]: With dead ends: 1235 [2022-02-18 14:46:08,167 INFO L226 Difference]: Without dead ends: 1184 [2022-02-18 14:46:08,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2022-02-18 14:46:08,168 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 231 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-18 14:46:08,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 1467 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-18 14:46:08,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2022-02-18 14:46:08,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 909. [2022-02-18 14:46:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 908 states have (on average 2.4129955947136565) internal successors, (2191), 908 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:08,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 2191 transitions. [2022-02-18 14:46:08,186 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 2191 transitions. Word has length 115 [2022-02-18 14:46:08,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:46:08,186 INFO L470 AbstractCegarLoop]: Abstraction has 909 states and 2191 transitions. [2022-02-18 14:46:08,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:08,186 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 2191 transitions. [2022-02-18 14:46:08,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-02-18 14:46:08,188 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:46:08,188 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:46:08,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-18 14:46:08,188 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:46:08,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:46:08,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1515110916, now seen corresponding path program 7 times [2022-02-18 14:46:08,189 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:46:08,189 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465493092] [2022-02-18 14:46:08,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:46:08,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:46:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:46:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-18 14:46:08,479 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:46:08,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465493092] [2022-02-18 14:46:08,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465493092] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 14:46:08,480 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 14:46:08,480 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-18 14:46:08,480 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044938338] [2022-02-18 14:46:08,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 14:46:08,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-18 14:46:08,480 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:46:08,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-18 14:46:08,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-02-18 14:46:08,481 INFO L87 Difference]: Start difference. First operand 909 states and 2191 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:08,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:46:08,718 INFO L93 Difference]: Finished difference Result 1193 states and 2870 transitions. [2022-02-18 14:46:08,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-18 14:46:08,718 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2022-02-18 14:46:08,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:46:08,722 INFO L225 Difference]: With dead ends: 1193 [2022-02-18 14:46:08,722 INFO L226 Difference]: Without dead ends: 1142 [2022-02-18 14:46:08,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2022-02-18 14:46:08,723 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 238 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 14:46:08,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 1139 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 14:46:08,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2022-02-18 14:46:08,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 913. [2022-02-18 14:46:08,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 912 states have (on average 2.418859649122807) internal successors, (2206), 912 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 2206 transitions. [2022-02-18 14:46:08,741 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 2206 transitions. Word has length 115 [2022-02-18 14:46:08,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:46:08,741 INFO L470 AbstractCegarLoop]: Abstraction has 913 states and 2206 transitions. [2022-02-18 14:46:08,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:08,741 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 2206 transitions. [2022-02-18 14:46:08,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-02-18 14:46:08,743 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:46:08,743 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:46:08,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-18 14:46:08,743 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:46:08,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:46:08,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1478067194, now seen corresponding path program 8 times [2022-02-18 14:46:08,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:46:08,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781637831] [2022-02-18 14:46:08,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:46:08,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:46:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:46:08,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-18 14:46:08,966 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:46:08,966 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781637831] [2022-02-18 14:46:08,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781637831] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 14:46:08,966 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 14:46:08,966 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-18 14:46:08,966 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154658619] [2022-02-18 14:46:08,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 14:46:08,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-18 14:46:08,967 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:46:08,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-18 14:46:08,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-02-18 14:46:08,968 INFO L87 Difference]: Start difference. First operand 913 states and 2206 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:09,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:46:09,163 INFO L93 Difference]: Finished difference Result 1094 states and 2651 transitions. [2022-02-18 14:46:09,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-18 14:46:09,164 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2022-02-18 14:46:09,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:46:09,168 INFO L225 Difference]: With dead ends: 1094 [2022-02-18 14:46:09,168 INFO L226 Difference]: Without dead ends: 1031 [2022-02-18 14:46:09,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2022-02-18 14:46:09,168 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 205 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 14:46:09,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 1020 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 14:46:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2022-02-18 14:46:09,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 885. [2022-02-18 14:46:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 2.408371040723982) internal successors, (2129), 884 states have internal predecessors, (2129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 2129 transitions. [2022-02-18 14:46:09,188 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 2129 transitions. Word has length 115 [2022-02-18 14:46:09,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:46:09,188 INFO L470 AbstractCegarLoop]: Abstraction has 885 states and 2129 transitions. [2022-02-18 14:46:09,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:09,189 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 2129 transitions. [2022-02-18 14:46:09,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-02-18 14:46:09,191 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:46:09,191 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:46:09,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-18 14:46:09,192 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:46:09,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:46:09,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1174464202, now seen corresponding path program 9 times [2022-02-18 14:46:09,192 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:46:09,192 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809249826] [2022-02-18 14:46:09,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:46:09,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:46:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:46:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-18 14:46:09,494 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:46:09,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809249826] [2022-02-18 14:46:09,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809249826] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 14:46:09,494 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 14:46:09,494 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-18 14:46:09,494 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902809063] [2022-02-18 14:46:09,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 14:46:09,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-18 14:46:09,495 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:46:09,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-18 14:46:09,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-02-18 14:46:09,495 INFO L87 Difference]: Start difference. First operand 885 states and 2129 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:46:09,734 INFO L93 Difference]: Finished difference Result 1171 states and 2834 transitions. [2022-02-18 14:46:09,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-18 14:46:09,735 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2022-02-18 14:46:09,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:46:09,739 INFO L225 Difference]: With dead ends: 1171 [2022-02-18 14:46:09,739 INFO L226 Difference]: Without dead ends: 1120 [2022-02-18 14:46:09,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2022-02-18 14:46:09,739 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 186 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-18 14:46:09,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 1139 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-18 14:46:09,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2022-02-18 14:46:09,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 901. [2022-02-18 14:46:09,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 2.4144444444444444) internal successors, (2173), 900 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:09,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 2173 transitions. [2022-02-18 14:46:09,765 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 2173 transitions. Word has length 115 [2022-02-18 14:46:09,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:46:09,765 INFO L470 AbstractCegarLoop]: Abstraction has 901 states and 2173 transitions. [2022-02-18 14:46:09,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:09,765 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 2173 transitions. [2022-02-18 14:46:09,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-02-18 14:46:09,767 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:46:09,767 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:46:09,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-18 14:46:09,768 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:46:09,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:46:09,768 INFO L85 PathProgramCache]: Analyzing trace with hash -678895382, now seen corresponding path program 10 times [2022-02-18 14:46:09,768 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:46:09,768 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709278881] [2022-02-18 14:46:09,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:46:09,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:46:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:46:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-18 14:46:10,090 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:46:10,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709278881] [2022-02-18 14:46:10,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709278881] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 14:46:10,090 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 14:46:10,090 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-18 14:46:10,090 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921597431] [2022-02-18 14:46:10,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 14:46:10,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-18 14:46:10,090 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:46:10,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-18 14:46:10,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-18 14:46:10,091 INFO L87 Difference]: Start difference. First operand 901 states and 2173 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:10,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:46:10,348 INFO L93 Difference]: Finished difference Result 1189 states and 2859 transitions. [2022-02-18 14:46:10,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-18 14:46:10,348 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2022-02-18 14:46:10,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:46:10,352 INFO L225 Difference]: With dead ends: 1189 [2022-02-18 14:46:10,352 INFO L226 Difference]: Without dead ends: 1138 [2022-02-18 14:46:10,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-02-18 14:46:10,353 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 188 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-18 14:46:10,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 1286 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-18 14:46:10,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2022-02-18 14:46:10,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 905. [2022-02-18 14:46:10,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 904 states have (on average 2.420353982300885) internal successors, (2188), 904 states have internal predecessors, (2188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:10,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 2188 transitions. [2022-02-18 14:46:10,368 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 2188 transitions. Word has length 115 [2022-02-18 14:46:10,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:46:10,369 INFO L470 AbstractCegarLoop]: Abstraction has 905 states and 2188 transitions. [2022-02-18 14:46:10,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:10,369 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 2188 transitions. [2022-02-18 14:46:10,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-02-18 14:46:10,370 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:46:10,371 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:46:10,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-18 14:46:10,371 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:46:10,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:46:10,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1980684568, now seen corresponding path program 11 times [2022-02-18 14:46:10,371 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:46:10,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954412574] [2022-02-18 14:46:10,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:46:10,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:46:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:46:10,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-18 14:46:10,626 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:46:10,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954412574] [2022-02-18 14:46:10,626 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954412574] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 14:46:10,626 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 14:46:10,626 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-18 14:46:10,626 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310307724] [2022-02-18 14:46:10,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 14:46:10,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-18 14:46:10,626 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:46:10,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-18 14:46:10,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-02-18 14:46:10,627 INFO L87 Difference]: Start difference. First operand 905 states and 2188 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:10,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:46:10,822 INFO L93 Difference]: Finished difference Result 1090 states and 2640 transitions. [2022-02-18 14:46:10,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-18 14:46:10,822 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2022-02-18 14:46:10,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:46:10,826 INFO L225 Difference]: With dead ends: 1090 [2022-02-18 14:46:10,826 INFO L226 Difference]: Without dead ends: 1027 [2022-02-18 14:46:10,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-02-18 14:46:10,826 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 194 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 14:46:10,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 1097 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 14:46:10,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2022-02-18 14:46:10,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 897. [2022-02-18 14:46:10,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 896 states have (on average 2.4129464285714284) internal successors, (2162), 896 states have internal predecessors, (2162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:10,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 2162 transitions. [2022-02-18 14:46:10,841 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 2162 transitions. Word has length 115 [2022-02-18 14:46:10,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:46:10,841 INFO L470 AbstractCegarLoop]: Abstraction has 897 states and 2162 transitions. [2022-02-18 14:46:10,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:10,841 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 2162 transitions. [2022-02-18 14:46:10,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-02-18 14:46:10,843 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:46:10,843 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:46:10,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-18 14:46:10,843 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:46:10,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:46:10,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1065283192, now seen corresponding path program 12 times [2022-02-18 14:46:10,843 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:46:10,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902783334] [2022-02-18 14:46:10,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:46:10,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:46:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:46:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-18 14:46:11,113 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:46:11,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902783334] [2022-02-18 14:46:11,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902783334] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 14:46:11,113 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 14:46:11,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-18 14:46:11,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959689156] [2022-02-18 14:46:11,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 14:46:11,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-18 14:46:11,113 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:46:11,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-18 14:46:11,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-02-18 14:46:11,114 INFO L87 Difference]: Start difference. First operand 897 states and 2162 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:11,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:46:11,342 INFO L93 Difference]: Finished difference Result 1201 states and 2904 transitions. [2022-02-18 14:46:11,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-18 14:46:11,342 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2022-02-18 14:46:11,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:46:11,346 INFO L225 Difference]: With dead ends: 1201 [2022-02-18 14:46:11,346 INFO L226 Difference]: Without dead ends: 1150 [2022-02-18 14:46:11,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2022-02-18 14:46:11,347 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 202 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 14:46:11,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 1037 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 14:46:11,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2022-02-18 14:46:11,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 869. [2022-02-18 14:46:11,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 2.402073732718894) internal successors, (2085), 868 states have internal predecessors, (2085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:11,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 2085 transitions. [2022-02-18 14:46:11,361 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 2085 transitions. Word has length 115 [2022-02-18 14:46:11,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:46:11,361 INFO L470 AbstractCegarLoop]: Abstraction has 869 states and 2085 transitions. [2022-02-18 14:46:11,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:11,361 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 2085 transitions. [2022-02-18 14:46:11,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-02-18 14:46:11,363 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:46:11,363 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:46:11,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-18 14:46:11,363 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:46:11,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:46:11,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1756827106, now seen corresponding path program 1 times [2022-02-18 14:46:11,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:46:11,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855148280] [2022-02-18 14:46:11,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:46:11,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:46:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:46:11,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-18 14:46:11,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:46:11,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855148280] [2022-02-18 14:46:11,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855148280] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 14:46:11,407 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 14:46:11,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-18 14:46:11,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943985506] [2022-02-18 14:46:11,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 14:46:11,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-18 14:46:11,408 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:46:11,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-18 14:46:11,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-18 14:46:11,408 INFO L87 Difference]: Start difference. First operand 869 states and 2085 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:11,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:46:11,429 INFO L93 Difference]: Finished difference Result 1737 states and 4340 transitions. [2022-02-18 14:46:11,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-18 14:46:11,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-02-18 14:46:11,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:46:11,435 INFO L225 Difference]: With dead ends: 1737 [2022-02-18 14:46:11,435 INFO L226 Difference]: Without dead ends: 1520 [2022-02-18 14:46:11,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-18 14:46:11,435 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 117 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-18 14:46:11,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 272 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-18 14:46:11,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2022-02-18 14:46:11,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1212. [2022-02-18 14:46:11,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1211 states have (on average 2.564822460776218) internal successors, (3106), 1211 states have internal predecessors, (3106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:11,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 3106 transitions. [2022-02-18 14:46:11,459 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 3106 transitions. Word has length 120 [2022-02-18 14:46:11,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:46:11,459 INFO L470 AbstractCegarLoop]: Abstraction has 1212 states and 3106 transitions. [2022-02-18 14:46:11,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:11,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 3106 transitions. [2022-02-18 14:46:11,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-02-18 14:46:11,462 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:46:11,462 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:46:11,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-18 14:46:11,463 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:46:11,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:46:11,463 INFO L85 PathProgramCache]: Analyzing trace with hash -293483883, now seen corresponding path program 1 times [2022-02-18 14:46:11,463 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:46:11,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315967361] [2022-02-18 14:46:11,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:46:11,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:46:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:46:11,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:46:11,521 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:46:11,522 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315967361] [2022-02-18 14:46:11,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315967361] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:46:11,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656625542] [2022-02-18 14:46:11,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:46:11,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:46:11,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:46:11,540 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-02-18 14:46:11,559 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-02-18 14:46:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:46:11,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-18 14:46:11,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:46:11,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:46:11,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 14:46:12,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:46:12,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656625542] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 14:46:12,270 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 14:46:12,270 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-02-18 14:46:12,270 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107831193] [2022-02-18 14:46:12,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 14:46:12,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-18 14:46:12,271 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:46:12,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-18 14:46:12,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-02-18 14:46:12,271 INFO L87 Difference]: Start difference. First operand 1212 states and 3106 transitions. Second operand has 19 states, 19 states have (on average 10.526315789473685) internal successors, (200), 19 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:12,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:46:12,417 INFO L93 Difference]: Finished difference Result 1683 states and 4216 transitions. [2022-02-18 14:46:12,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-18 14:46:12,418 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.526315789473685) internal successors, (200), 19 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-02-18 14:46:12,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:46:12,422 INFO L225 Difference]: With dead ends: 1683 [2022-02-18 14:46:12,422 INFO L226 Difference]: Without dead ends: 1224 [2022-02-18 14:46:12,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2022-02-18 14:46:12,423 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 739 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 14:46:12,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [739 Valid, 741 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 14:46:12,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2022-02-18 14:46:12,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1219. [2022-02-18 14:46:12,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1218 states have (on average 2.5558292282430215) internal successors, (3113), 1218 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:12,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 3113 transitions. [2022-02-18 14:46:12,446 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 3113 transitions. Word has length 121 [2022-02-18 14:46:12,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:46:12,446 INFO L470 AbstractCegarLoop]: Abstraction has 1219 states and 3113 transitions. [2022-02-18 14:46:12,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.526315789473685) internal successors, (200), 19 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:12,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 3113 transitions. [2022-02-18 14:46:12,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-02-18 14:46:12,449 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:46:12,449 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-18 14:46:12,482 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-02-18 14:46:12,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-02-18 14:46:12,664 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:46:12,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:46:12,664 INFO L85 PathProgramCache]: Analyzing trace with hash -927741638, now seen corresponding path program 2 times [2022-02-18 14:46:12,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:46:12,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723847474] [2022-02-18 14:46:12,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:46:12,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:46:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:46:13,357 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:46:13,357 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:46:13,357 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723847474] [2022-02-18 14:46:13,357 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723847474] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:46:13,357 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691216989] [2022-02-18 14:46:13,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-18 14:46:13,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:46:13,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:46:13,358 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-02-18 14:46:13,369 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-02-18 14:46:13,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-18 14:46:13,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 14:46:13,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 39 conjunts are in the unsatisfiable core [2022-02-18 14:46:13,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:46:14,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 14:46:14,551 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 18 treesize of output 20 [2022-02-18 14:46:14,736 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-02-18 14:46:14,736 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 23 treesize of output 10 [2022-02-18 14:46:14,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:46:14,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 14:46:15,088 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:46:15,088 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 45 treesize of output 45 [2022-02-18 14:46:15,092 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 24 treesize of output 18 [2022-02-18 14:46:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:46:16,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691216989] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 14:46:16,289 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 14:46:16,289 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 20, 21] total 62 [2022-02-18 14:46:16,289 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105259012] [2022-02-18 14:46:16,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 14:46:16,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-02-18 14:46:16,290 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:46:16,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-02-18 14:46:16,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=3434, Unknown=2, NotChecked=0, Total=3782 [2022-02-18 14:46:16,291 INFO L87 Difference]: Start difference. First operand 1219 states and 3113 transitions. Second operand has 62 states, 62 states have (on average 4.838709677419355) internal successors, (300), 62 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:19,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:46:19,766 INFO L93 Difference]: Finished difference Result 5266 states and 13499 transitions. [2022-02-18 14:46:19,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-02-18 14:46:19,767 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 4.838709677419355) internal successors, (300), 62 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2022-02-18 14:46:19,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:46:19,781 INFO L225 Difference]: With dead ends: 5266 [2022-02-18 14:46:19,781 INFO L226 Difference]: Without dead ends: 5254 [2022-02-18 14:46:19,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 230 SyntacticMatches, 9 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2860 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1470, Invalid=9845, Unknown=27, NotChecked=0, Total=11342 [2022-02-18 14:46:19,783 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 2123 mSDsluCounter, 6489 mSDsCounter, 0 mSdLazyCounter, 1730 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2123 SdHoareTripleChecker+Valid, 6401 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 346 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-18 14:46:19,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2123 Valid, 6401 Invalid, 2155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1730 Invalid, 0 Unknown, 346 Unchecked, 0.8s Time] [2022-02-18 14:46:19,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2022-02-18 14:46:19,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 3004. [2022-02-18 14:46:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3004 states, 3003 states have (on average 2.668997668997669) internal successors, (8015), 3003 states have internal predecessors, (8015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:19,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 8015 transitions. [2022-02-18 14:46:19,871 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 8015 transitions. Word has length 128 [2022-02-18 14:46:19,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:46:19,871 INFO L470 AbstractCegarLoop]: Abstraction has 3004 states and 8015 transitions. [2022-02-18 14:46:19,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 4.838709677419355) internal successors, (300), 62 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:19,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 8015 transitions. [2022-02-18 14:46:19,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-02-18 14:46:19,877 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:46:19,877 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-18 14:46:19,898 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-02-18 14:46:20,091 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,SelfDestructingSolverStorable16 [2022-02-18 14:46:20,091 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:46:20,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:46:20,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1102347870, now seen corresponding path program 3 times [2022-02-18 14:46:20,092 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:46:20,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640835150] [2022-02-18 14:46:20,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:46:20,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:46:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:46:20,704 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:46:20,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:46:20,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640835150] [2022-02-18 14:46:20,705 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640835150] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:46:20,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578619759] [2022-02-18 14:46:20,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-18 14:46:20,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:46:20,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:46:20,706 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-02-18 14:46:20,707 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-02-18 14:46:20,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-18 14:46:20,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 14:46:20,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-18 14:46:20,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:46:21,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 14:46:21,217 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 18 treesize of output 20 [2022-02-18 14:46:21,257 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 7 [2022-02-18 14:46:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-18 14:46:21,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 14:46:21,367 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_258 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_258) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) 0))) is different from false [2022-02-18 14:46:21,399 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:46:21,400 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 45 treesize of output 45 [2022-02-18 14:46:21,402 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 24 treesize of output 18 [2022-02-18 14:46:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-18 14:46:21,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578619759] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 14:46:21,807 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 14:46:21,808 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 39 [2022-02-18 14:46:21,808 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265922413] [2022-02-18 14:46:21,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 14:46:21,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-02-18 14:46:21,808 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:46:21,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-02-18 14:46:21,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1312, Unknown=1, NotChecked=72, Total=1482 [2022-02-18 14:46:21,809 INFO L87 Difference]: Start difference. First operand 3004 states and 8015 transitions. Second operand has 39 states, 39 states have (on average 7.128205128205129) internal successors, (278), 39 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:24,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:46:24,572 INFO L93 Difference]: Finished difference Result 5956 states and 15868 transitions. [2022-02-18 14:46:24,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-02-18 14:46:24,588 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.128205128205129) internal successors, (278), 39 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2022-02-18 14:46:24,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:46:24,601 INFO L225 Difference]: With dead ends: 5956 [2022-02-18 14:46:24,602 INFO L226 Difference]: Without dead ends: 5956 [2022-02-18 14:46:24,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 238 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=702, Invalid=4557, Unknown=1, NotChecked=142, Total=5402 [2022-02-18 14:46:24,604 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 1738 mSDsluCounter, 3641 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 3598 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-18 14:46:24,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1738 Valid, 3598 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1417 Invalid, 0 Unknown, 272 Unchecked, 0.6s Time] [2022-02-18 14:46:24,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5956 states. [2022-02-18 14:46:24,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5956 to 2795. [2022-02-18 14:46:24,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2795 states, 2794 states have (on average 2.6385110952040085) internal successors, (7372), 2794 states have internal predecessors, (7372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2795 states to 2795 states and 7372 transitions. [2022-02-18 14:46:24,687 INFO L78 Accepts]: Start accepts. Automaton has 2795 states and 7372 transitions. Word has length 128 [2022-02-18 14:46:24,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:46:24,687 INFO L470 AbstractCegarLoop]: Abstraction has 2795 states and 7372 transitions. [2022-02-18 14:46:24,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.128205128205129) internal successors, (278), 39 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2795 states and 7372 transitions. [2022-02-18 14:46:24,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-02-18 14:46:24,693 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:46:24,693 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:46:24,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-18 14:46:24,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-02-18 14:46:24,906 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:46:24,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:46:24,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1695806250, now seen corresponding path program 1 times [2022-02-18 14:46:24,907 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:46:24,907 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751635988] [2022-02-18 14:46:24,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:46:24,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:46:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:46:26,360 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:46:26,360 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:46:26,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751635988] [2022-02-18 14:46:26,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751635988] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:46:26,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607539458] [2022-02-18 14:46:26,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:46:26,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:46:26,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:46:26,361 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-02-18 14:46:26,362 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-02-18 14:46:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:46:26,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 68 conjunts are in the unsatisfiable core [2022-02-18 14:46:26,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:46:28,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 14:46:28,268 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 18 treesize of output 20 [2022-02-18 14:46:28,610 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-02-18 14:46:28,610 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 23 treesize of output 10 [2022-02-18 14:46:29,314 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:46:29,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 14:46:30,612 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:46:30,612 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 87 treesize of output 87 [2022-02-18 14:46:30,616 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 66 treesize of output 60 [2022-02-18 14:46:41,447 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:46:41,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607539458] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 14:46:41,447 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 14:46:41,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 36] total 101 [2022-02-18 14:46:41,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288287888] [2022-02-18 14:46:41,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 14:46:41,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2022-02-18 14:46:41,448 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:46:41,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2022-02-18 14:46:41,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=9298, Unknown=19, NotChecked=0, Total=10100 [2022-02-18 14:46:41,450 INFO L87 Difference]: Start difference. First operand 2795 states and 7372 transitions. Second operand has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:46:45,403 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse1 (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296))) (.cse4 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (.cse0 (not (<= 0 c_~q_back~0))) (.cse3 (not (< c_~q_back~0 c_~n~0)))) (and (= c_~y~0 0) (or .cse0 (and .cse1 (= c_~N~0 .cse2)) .cse3 .cse4) (or .cse0 .cse3 (and .cse1 (= (+ c_~s~0 .cse2) c_~N~0)) .cse4) (or .cse0 .cse3 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse1) .cse4) (or .cse0 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) .cse3 (and (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse7 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse6 (+ .cse7 aux_mod_aux_mod_~C~0_30_61)) (.cse5 (* 4294967295 c_~x~0))) (or (<= (+ .cse5 c_~y~0 4294967296) .cse6) (= (+ (* (- 1) c_~y~0) .cse7 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse6 (+ .cse5 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61))))) (forall ((v_ArrVal_287 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_287) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))) (= c_~x~0 0))) is different from false [2022-02-18 14:47:09,707 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~x~0 4294967296))) (let ((.cse3 (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse2)) (.cse1 (= c_~s~0 c_~N~0)) (.cse0 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0)))) (and (or .cse0 (and .cse1 (= .cse2 (mod c_~y~0 4294967296)))) (or (and .cse3 (forall ((v_ArrVal_287 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_287) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) (not (<= 0 c_~q_back~0)) (< (+ |c_thread1Thread1of1ForFork0_#t~post1#1| 1) c_~N~0) (not (< c_~q_back~0 c_~n~0))) (or (and .cse3 .cse1) .cse0)))) is different from false [2022-02-18 14:47:13,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:47:13,527 INFO L93 Difference]: Finished difference Result 6920 states and 18322 transitions. [2022-02-18 14:47:13,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2022-02-18 14:47:13,527 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-02-18 14:47:13,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:47:13,540 INFO L225 Difference]: With dead ends: 6920 [2022-02-18 14:47:13,540 INFO L226 Difference]: Without dead ends: 6713 [2022-02-18 14:47:13,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 221 SyntacticMatches, 36 SemanticMatches, 222 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 20170 ImplicationChecksByTransitivity, 40.8s TimeCoverageRelationStatistics Valid=4268, Invalid=44634, Unknown=168, NotChecked=882, Total=49952 [2022-02-18 14:47:13,546 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 2819 mSDsluCounter, 11950 mSDsCounter, 0 mSdLazyCounter, 3112 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2819 SdHoareTripleChecker+Valid, 11443 SdHoareTripleChecker+Invalid, 8145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 3112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4830 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-18 14:47:13,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2819 Valid, 11443 Invalid, 8145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 3112 Invalid, 0 Unknown, 4830 Unchecked, 2.0s Time] [2022-02-18 14:47:13,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6713 states. [2022-02-18 14:47:13,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6713 to 3255. [2022-02-18 14:47:13,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3255 states, 3254 states have (on average 2.6779348494161033) internal successors, (8714), 3254 states have internal predecessors, (8714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:47:13,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 8714 transitions. [2022-02-18 14:47:13,637 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 8714 transitions. Word has length 133 [2022-02-18 14:47:13,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:47:13,638 INFO L470 AbstractCegarLoop]: Abstraction has 3255 states and 8714 transitions. [2022-02-18 14:47:13,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:47:13,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 8714 transitions. [2022-02-18 14:47:13,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-02-18 14:47:13,647 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:47:13,647 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:47:13,674 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-02-18 14:47:13,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:47:13,871 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:47:13,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:47:13,871 INFO L85 PathProgramCache]: Analyzing trace with hash 745801462, now seen corresponding path program 2 times [2022-02-18 14:47:13,871 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:47:13,871 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539510061] [2022-02-18 14:47:13,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:47:13,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:47:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:47:15,320 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:47:15,321 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:47:15,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539510061] [2022-02-18 14:47:15,321 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539510061] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:47:15,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405206446] [2022-02-18 14:47:15,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-18 14:47:15,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:47:15,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:47:15,322 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-02-18 14:47:15,322 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-02-18 14:47:15,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-18 14:47:15,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 14:47:15,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 77 conjunts are in the unsatisfiable core [2022-02-18 14:47:15,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:47:17,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 14:47:17,457 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 18 treesize of output 20 [2022-02-18 14:47:17,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 14:47:17,821 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:47:17,821 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 21 treesize of output 10 [2022-02-18 14:47:18,499 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:47:18,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 14:47:19,664 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:47:19,665 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 87 treesize of output 87 [2022-02-18 14:47:19,668 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 66 treesize of output 60 [2022-02-18 14:47:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:47:36,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405206446] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 14:47:36,889 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 14:47:36,889 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 36] total 101 [2022-02-18 14:47:36,889 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619718674] [2022-02-18 14:47:36,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 14:47:36,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2022-02-18 14:47:36,889 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:47:36,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2022-02-18 14:47:36,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=9267, Unknown=19, NotChecked=0, Total=10100 [2022-02-18 14:47:36,891 INFO L87 Difference]: Start difference. First operand 3255 states and 8714 transitions. Second operand has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:47:49,402 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (mod c_~x~0 4294967296))) (let ((.cse3 (= c_~s~0 c_~N~0)) (.cse6 (< c_~q_back~0 0)) (.cse7 (<= c_~n~0 c_~q_back~0)) (.cse0 (not (<= 0 c_~q_back~0))) (.cse1 (not (< c_~q_back~0 c_~n~0))) (.cse5 (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse4)) (.cse2 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0))) (and (or .cse0 .cse1 .cse2 (and .cse3 (= .cse4 (mod c_~y~0 4294967296)))) (= c_~y~0 0) (or .cse0 (and .cse5 .cse3) .cse1 .cse2) (or (and .cse5 (= c_~N~0 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) .cse6 .cse7 .cse2) (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) .cse6 (and (forall ((v_ArrVal_316 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse10 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse9 (+ .cse10 aux_mod_aux_mod_~C~0_30_61)) (.cse8 (* 4294967295 c_~x~0))) (or (<= (+ .cse8 c_~y~0 4294967296) .cse9) (= (+ (* (- 1) c_~y~0) .cse10 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse9 (+ .cse8 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61)))))) .cse7) (or .cse0 .cse1 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse5) .cse2) (= c_~x~0 0)))) is different from false [2022-02-18 14:47:56,968 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse1 (= c_~s~0 c_~N~0)) (.cse3 (mod c_~x~0 4294967296)) (.cse2 (mod c_~y~0 4294967296))) (and (or .cse0 (and .cse1 (= .cse2 (mod (+ c_~C~0 c_~x~0) 4294967296)))) (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse3) (forall ((v_ArrVal_316 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) (< c_~q_back~0 0) (<= c_~n~0 c_~q_back~0)) (or .cse0 (and .cse1 (= .cse3 .cse2))))) is different from false [2022-02-18 14:48:11,301 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-18 14:48:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:48:13,448 INFO L93 Difference]: Finished difference Result 6391 states and 16747 transitions. [2022-02-18 14:48:13,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-02-18 14:48:13,448 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-02-18 14:48:13,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:48:13,460 INFO L225 Difference]: With dead ends: 6391 [2022-02-18 14:48:13,461 INFO L226 Difference]: Without dead ends: 6274 [2022-02-18 14:48:13,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 210 SyntacticMatches, 15 SemanticMatches, 197 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 14171 ImplicationChecksByTransitivity, 50.9s TimeCoverageRelationStatistics Valid=3181, Invalid=35366, Unknown=73, NotChecked=782, Total=39402 [2022-02-18 14:48:13,463 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 2252 mSDsluCounter, 10389 mSDsCounter, 0 mSdLazyCounter, 2185 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2252 SdHoareTripleChecker+Valid, 10129 SdHoareTripleChecker+Invalid, 4684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 2185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2335 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-02-18 14:48:13,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2252 Valid, 10129 Invalid, 4684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 2185 Invalid, 0 Unknown, 2335 Unchecked, 3.1s Time] [2022-02-18 14:48:13,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6274 states. [2022-02-18 14:48:13,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6274 to 3728. [2022-02-18 14:48:13,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3728 states, 3727 states have (on average 2.6734639119935606) internal successors, (9964), 3727 states have internal predecessors, (9964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:48:13,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3728 states to 3728 states and 9964 transitions. [2022-02-18 14:48:13,587 INFO L78 Accepts]: Start accepts. Automaton has 3728 states and 9964 transitions. Word has length 133 [2022-02-18 14:48:13,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:48:13,587 INFO L470 AbstractCegarLoop]: Abstraction has 3728 states and 9964 transitions. [2022-02-18 14:48:13,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:48:13,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3728 states and 9964 transitions. [2022-02-18 14:48:13,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-02-18 14:48:13,595 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:48:13,595 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:48:13,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-18 14:48:13,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:48:13,811 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:48:13,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:48:13,812 INFO L85 PathProgramCache]: Analyzing trace with hash -555987724, now seen corresponding path program 3 times [2022-02-18 14:48:13,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:48:13,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436863471] [2022-02-18 14:48:13,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:48:13,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:48:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:48:15,253 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:48:15,253 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:48:15,253 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436863471] [2022-02-18 14:48:15,253 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436863471] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:48:15,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223180946] [2022-02-18 14:48:15,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-18 14:48:15,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:48:15,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:48:15,256 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-02-18 14:48:15,256 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-02-18 14:48:15,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-18 14:48:15,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 14:48:15,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 64 conjunts are in the unsatisfiable core [2022-02-18 14:48:15,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:48:17,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 14:48:17,266 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 18 treesize of output 20 [2022-02-18 14:48:17,589 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-02-18 14:48:17,589 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 23 treesize of output 10 [2022-02-18 14:48:18,283 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:48:18,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 14:48:19,604 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:48:19,605 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 87 treesize of output 87 [2022-02-18 14:48:19,615 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 66 treesize of output 60 [2022-02-18 14:48:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:48:29,664 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223180946] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 14:48:29,664 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 14:48:29,664 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 37] total 103 [2022-02-18 14:48:29,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210073156] [2022-02-18 14:48:29,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 14:48:29,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-02-18 14:48:29,665 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:48:29,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-02-18 14:48:29,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=771, Invalid=9718, Unknown=17, NotChecked=0, Total=10506 [2022-02-18 14:48:29,666 INFO L87 Difference]: Start difference. First operand 3728 states and 9964 transitions. Second operand has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:48:40,930 WARN L228 SmtUtils]: Spent 5.27s on a formula simplification. DAG size of input: 75 DAG size of output: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-18 14:48:55,147 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (mod (+ c_~C~0 c_~y~0) 4294967296)) (.cse8 (+ (* c_~q_front~0 4) c_~q~0.offset))) (let ((.cse5 (<= c_~x~0 c_~C~0)) (.cse0 (<= c_~y~0 c_~x~0)) (.cse1 (<= c_~s~0 c_~N~0)) (.cse2 (<= c_~x~0 c_~y~0)) (.cse6 (<= c_~C~0 c_~x~0)) (.cse3 (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (.cse9 (select (select |c_#memory_int| c_~q~0.base) .cse8)) (.cse12 (= .cse7 (mod c_~x~0 4294967296))) (.cse13 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (.cse10 (not (<= 0 c_~q_back~0))) (.cse11 (not (< c_~q_back~0 c_~n~0)))) (and (= c_~y~0 0) (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1) (or (and (<= c_~N~0 c_~s~0) .cse0 .cse1 .cse2) .cse3) (or (let ((.cse4 (+ c_~s~0 1))) (and (<= .cse4 (+ c_~N~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) (<= (+ |c_thread2Thread1of1ForFork1_~j~0#1| |c_thread1Thread1of1ForFork0_~i~0#1|) .cse4) .cse5 .cse6)) (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0))) (<= 1 c_~N~0) .cse5 (or .cse3 (and .cse0 .cse1 (<= |c_thread1Thread1of1ForFork0_~i~0#1| c_~s~0) .cse2)) .cse6 (or (and (= c_~s~0 c_~N~0) (= .cse7 (mod (+ c_~C~0 c_~x~0) 4294967296))) (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (or (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) .cse3) (or .cse3 (and (<= .cse8 0) (<= 0 c_~q_front~0) (= .cse9 1))) (or .cse10 .cse11 (and .cse12 (= (+ c_~s~0 .cse9) c_~N~0)) .cse13) (= c_~q~0.offset 0) (or .cse10 .cse11 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse12) .cse13) (or .cse10 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) .cse11 (and (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse16 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse15 (+ .cse16 aux_mod_aux_mod_~C~0_30_61)) (.cse14 (* 4294967295 c_~x~0))) (or (<= (+ .cse14 c_~y~0 4294967296) .cse15) (= (+ (* (- 1) c_~y~0) .cse16 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse15 (+ .cse14 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61))))) (forall ((v_ArrVal_345 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))))))) is different from false [2022-02-18 14:48:57,429 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (mod (+ c_~C~0 c_~y~0) 4294967296))) (let ((.cse2 (= c_~s~0 c_~N~0)) (.cse8 (mod (+ c_~C~0 c_~x~0) 4294967296)) (.cse7 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse6 (* (- 1) c_~C~0)) (.cse5 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse0 (not (<= 0 c_~q_back~0))) (.cse1 (= .cse9 (mod c_~x~0 4294967296))) (.cse3 (not (< c_~q_back~0 c_~n~0))) (.cse4 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1) (or .cse0 (and .cse1 (= c_~N~0 .cse5)) .cse3 .cse4) (= c_~s~0 1) (= (+ c_~x~0 .cse6) 0) (or .cse7 (and .cse2 (= (mod c_~y~0 4294967296) .cse8))) (or (and .cse2 (= .cse9 .cse8)) .cse7) (or (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (= (+ c_~y~0 .cse6) 0) (< 0 c_~N~0) (< 0 c_~n~0) (or (let ((.cse10 (+ c_~s~0 1))) (and (<= .cse10 (+ c_~N~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) (<= c_~y~0 c_~x~0) (<= (+ |c_thread2Thread1of1ForFork1_~j~0#1| |c_thread1Thread1of1ForFork0_~i~0#1|) .cse10) (<= c_~x~0 c_~y~0))) (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0))) (or .cse0 .cse3 (and .cse1 (= (+ c_~s~0 .cse5) c_~N~0)) .cse4) (= c_~q~0.offset 0) (or .cse0 .cse3 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse1) .cse4) (<= 1 c_~q_back~0) (or .cse0 (and .cse1 (forall ((v_ArrVal_345 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) .cse3 .cse4) (<= c_~n~0 2)))) is different from false [2022-02-18 14:48:57,844 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (= c_~s~0 c_~N~0) (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod (+ c_~C~0 c_~x~0) 4294967296))) (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (or (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (or (let ((.cse0 (+ c_~s~0 1))) (and (<= .cse0 (+ c_~N~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) (<= c_~y~0 c_~x~0) (<= (+ |c_thread2Thread1of1ForFork1_~j~0#1| |c_thread1Thread1of1ForFork0_~i~0#1|) .cse0) (<= c_~x~0 c_~y~0))) (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0))) (= c_~q~0.offset 0) (or (not (<= 0 c_~q_back~0)) (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (not (< c_~q_back~0 c_~n~0)) (and (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse3 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse2 (+ .cse3 aux_mod_aux_mod_~C~0_30_61)) (.cse1 (* 4294967295 c_~x~0))) (or (<= (+ .cse1 c_~y~0 4294967296) .cse2) (= (+ (* (- 1) c_~y~0) .cse3 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse2 (+ .cse1 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61))))) (forall ((v_ArrVal_345 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))))) is different from false [2022-02-18 14:49:01,227 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~y~0 c_~x~0)) (.cse6 (<= c_~s~0 c_~N~0)) (.cse5 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse1 (not (<= 0 c_~q_back~0))) (.cse2 (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296))) (.cse3 (not (< c_~q_back~0 c_~n~0))) (.cse4 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (.cse7 (<= c_~x~0 c_~y~0))) (and (<= c_~N~0 c_~s~0) .cse0 (or .cse1 (and .cse2 (= c_~s~0 c_~N~0)) .cse3 .cse4) (or .cse1 (and .cse2 (= c_~N~0 .cse5)) .cse3 .cse4) (= c_~s~0 1) .cse6 (= c_~C~0 c_~x~0) (<= c_~N~0 1) (or (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0))) (and .cse0 .cse6 (<= |c_thread1Thread1of1ForFork0_~i~0#1| c_~s~0) .cse7)) (< 0 c_~N~0) (or .cse1 .cse3 (and .cse2 (= (+ c_~s~0 .cse5) c_~N~0)) .cse4) (= c_~q~0.offset 0) (or .cse1 .cse3 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse2) .cse4) (= c_~C~0 c_~y~0) (or .cse1 (and .cse2 (forall ((v_ArrVal_345 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) .cse3 .cse4) .cse7)) is different from false [2022-02-18 14:49:02,000 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~s~0 c_~N~0)) (.cse2 (mod (+ c_~C~0 c_~x~0) 4294967296)) (.cse0 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0)))) (and (or .cse0 (and .cse1 (= (mod c_~y~0 4294967296) .cse2))) (or (and .cse1 (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse2)) .cse0) (or (not (<= 0 c_~q_back~0)) (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (not (< c_~q_back~0 c_~n~0)) (and (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse5 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse4 (+ .cse5 aux_mod_aux_mod_~C~0_30_61)) (.cse3 (* 4294967295 c_~x~0))) (or (<= (+ .cse3 c_~y~0 4294967296) .cse4) (= (+ (* (- 1) c_~y~0) .cse5 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse4 (+ .cse3 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61))))) (forall ((v_ArrVal_345 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))))) is different from false [2022-02-18 14:49:02,121 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~s~0 c_~N~0)) (.cse2 (mod (+ c_~C~0 c_~x~0) 4294967296)) (.cse0 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse3 (mod (+ c_~C~0 c_~y~0) 4294967296))) (and (or .cse0 (and .cse1 (= (mod c_~y~0 4294967296) .cse2))) (or (and .cse1 (= .cse3 .cse2)) .cse0) (or (not (<= 0 c_~q_back~0)) (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (and (= .cse3 (mod c_~x~0 4294967296)) (forall ((v_ArrVal_345 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) (not (< c_~q_back~0 c_~n~0))))) is different from false [2022-02-18 14:49:04,570 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~s~0 c_~N~0)) (.cse2 (mod (+ c_~C~0 c_~x~0) 4294967296)) (.cse0 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse3 (mod (+ c_~C~0 c_~y~0) 4294967296))) (and (or .cse0 (and .cse1 (= (mod c_~y~0 4294967296) .cse2))) (or (and .cse1 (= .cse3 .cse2)) .cse0) (or (not (<= 0 c_~q_back~0)) (and (= .cse3 (mod c_~x~0 4294967296)) (forall ((v_ArrVal_345 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) (not (< c_~q_back~0 c_~n~0)) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)))) is different from false [2022-02-18 14:49:31,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:49:31,090 INFO L93 Difference]: Finished difference Result 8213 states and 21368 transitions. [2022-02-18 14:49:31,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2022-02-18 14:49:31,090 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-02-18 14:49:31,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:49:31,103 INFO L225 Difference]: With dead ends: 8213 [2022-02-18 14:49:31,103 INFO L226 Difference]: Without dead ends: 7880 [2022-02-18 14:49:31,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 219 SyntacticMatches, 35 SemanticMatches, 241 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 22647 ImplicationChecksByTransitivity, 68.6s TimeCoverageRelationStatistics Valid=3919, Invalid=51494, Unknown=75, NotChecked=3318, Total=58806 [2022-02-18 14:49:31,106 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 2144 mSDsluCounter, 12075 mSDsCounter, 0 mSdLazyCounter, 2844 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2144 SdHoareTripleChecker+Valid, 11609 SdHoareTripleChecker+Invalid, 7360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 2844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4202 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-02-18 14:49:31,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2144 Valid, 11609 Invalid, 7360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 2844 Invalid, 0 Unknown, 4202 Unchecked, 3.0s Time] [2022-02-18 14:49:31,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7880 states. [2022-02-18 14:49:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7880 to 4000. [2022-02-18 14:49:31,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4000 states, 3999 states have (on average 2.686921730432608) internal successors, (10745), 3999 states have internal predecessors, (10745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:49:31,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4000 states to 4000 states and 10745 transitions. [2022-02-18 14:49:31,194 INFO L78 Accepts]: Start accepts. Automaton has 4000 states and 10745 transitions. Word has length 133 [2022-02-18 14:49:31,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:49:31,194 INFO L470 AbstractCegarLoop]: Abstraction has 4000 states and 10745 transitions. [2022-02-18 14:49:31,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:49:31,195 INFO L276 IsEmpty]: Start isEmpty. Operand 4000 states and 10745 transitions. [2022-02-18 14:49:31,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-02-18 14:49:31,202 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:49:31,202 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:49:31,229 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-02-18 14:49:31,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:49:31,415 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:49:31,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:49:31,416 INFO L85 PathProgramCache]: Analyzing trace with hash 887071450, now seen corresponding path program 4 times [2022-02-18 14:49:31,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:49:31,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297229523] [2022-02-18 14:49:31,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:49:31,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:49:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:49:32,991 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:49:32,992 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:49:32,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297229523] [2022-02-18 14:49:32,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297229523] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:49:32,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539239545] [2022-02-18 14:49:32,992 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-18 14:49:32,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:49:32,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:49:32,993 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 14:49:32,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-18 14:49:33,108 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-18 14:49:33,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 14:49:33,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 64 conjunts are in the unsatisfiable core [2022-02-18 14:49:33,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:49:34,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 14:49:34,986 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 18 treesize of output 20 [2022-02-18 14:49:35,354 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-02-18 14:49:35,354 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 23 treesize of output 10 [2022-02-18 14:49:36,069 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:49:36,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 14:49:37,367 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:49:37,367 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 87 treesize of output 87 [2022-02-18 14:49:37,370 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 66 treesize of output 60 [2022-02-18 14:49:48,587 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:49:48,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539239545] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 14:49:48,587 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 14:49:48,587 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 37] total 103 [2022-02-18 14:49:48,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084027731] [2022-02-18 14:49:48,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 14:49:48,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-02-18 14:49:48,588 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:49:48,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-02-18 14:49:48,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=772, Invalid=9715, Unknown=19, NotChecked=0, Total=10506 [2022-02-18 14:49:48,589 INFO L87 Difference]: Start difference. First operand 4000 states and 10745 transitions. Second operand has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:50:02,663 WARN L228 SmtUtils]: Spent 10.10s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-18 14:50:06,793 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (mod c_~x~0 4294967296)) (.cse4 (= c_~s~0 c_~N~0)) (.cse3 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0)))) (and (= c_~y~0 0) (<= c_~x~0 c_~C~0) (or (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0)) (and (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1) (<= 1 c_~N~0) (= c_~s~0 0))) (<= c_~C~0 c_~x~0) (or (and (forall ((v_ArrVal_374 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse2 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse1 (+ .cse2 aux_mod_aux_mod_~C~0_30_61)) (.cse0 (* 4294967295 c_~x~0))) (or (<= (+ .cse0 c_~y~0 4294967296) .cse1) (= (+ (* (- 1) c_~y~0) .cse2 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse1 (+ .cse0 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61)))))) (not (<= 0 c_~q_back~0)) (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (not (< c_~q_back~0 c_~n~0))) (or (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (or .cse3 (and .cse4 (= .cse5 (mod c_~y~0 4294967296)))) (= c_~q~0.offset 0) (or (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse5) .cse4) .cse3))) is different from false [2022-02-18 14:50:25,610 WARN L228 SmtUtils]: Spent 18.70s on a formula simplification. DAG size of input: 125 DAG size of output: 99 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-18 14:50:29,822 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (<= c_~s~0 c_~N~0)) (.cse4 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse0 (not (<= 0 c_~q_back~0))) (.cse2 (not (< c_~q_back~0 c_~n~0))) (.cse3 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (.cse1 (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296)))) (and (<= c_~N~0 c_~s~0) (<= c_~y~0 c_~x~0) (or .cse0 (and .cse1 (= c_~s~0 c_~N~0)) .cse2 .cse3) (or .cse0 (and .cse1 (= c_~N~0 .cse4)) .cse2 .cse3) (= c_~s~0 1) .cse5 (= c_~C~0 c_~x~0) (<= c_~N~0 1) (or (and .cse5 (<= |c_thread1Thread1of1ForFork0_~i~0#1| c_~s~0)) (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (< 0 c_~N~0) (or .cse0 .cse2 (and .cse1 (= (+ c_~s~0 .cse4) c_~N~0)) .cse3) (= c_~q~0.offset 0) (or .cse0 .cse2 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse1) .cse3) (= c_~C~0 c_~y~0) (or .cse0 .cse2 .cse3 (and .cse1 (forall ((v_ArrVal_374 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))) (<= c_~x~0 c_~y~0))) is different from false [2022-02-18 14:50:29,950 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296)))) (let ((.cse6 (<= c_~s~0 c_~N~0)) (.cse5 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse1 (and .cse4 (= c_~s~0 c_~N~0))) (.cse0 (not (<= 0 c_~q_back~0))) (.cse2 (not (< c_~q_back~0 c_~n~0))) (.cse3 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0))) (and (<= c_~N~0 c_~s~0) (<= c_~y~0 c_~x~0) (or .cse0 .cse1 .cse2 .cse3) (or .cse0 (and .cse4 (= c_~N~0 .cse5)) .cse2 .cse3) (= c_~s~0 1) .cse6 (= c_~C~0 c_~x~0) (<= c_~N~0 1) (or (and .cse6 (<= |c_thread1Thread1of1ForFork0_~i~0#1| c_~s~0)) (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (< 0 c_~N~0) (or .cse0 .cse2 (and .cse4 (= (+ c_~s~0 .cse5) c_~N~0)) .cse3) (= c_~q~0.offset 0) (or .cse0 .cse2 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse4) .cse3) (= c_~C~0 c_~y~0) (or .cse1 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (or .cse0 .cse2 .cse3 (and .cse4 (forall ((v_ArrVal_374 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))) (<= c_~x~0 c_~y~0)))) is different from false [2022-02-18 14:50:30,372 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~x~0 4294967296))) (let ((.cse2 (= c_~s~0 c_~N~0)) (.cse1 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse4 (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse3))) (and (= c_~y~0 0) (or (let ((.cse0 (+ c_~s~0 1))) (and (<= .cse0 (+ c_~N~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) (<= (+ |c_thread2Thread1of1ForFork1_~j~0#1| |c_thread1Thread1of1ForFork0_~i~0#1|) .cse0))) (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0))) (<= c_~x~0 c_~C~0) (<= c_~C~0 c_~x~0) (or (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (or .cse1 (and .cse2 (= .cse3 (mod c_~y~0 4294967296)))) (= c_~q~0.offset 0) (or (and .cse4 .cse2) .cse1) (or (not (<= 0 c_~q_back~0)) (not (< c_~q_back~0 c_~n~0)) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0) (and .cse4 (forall ((v_ArrVal_374 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))))))) is different from false [2022-02-18 14:50:39,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:50:39,689 INFO L93 Difference]: Finished difference Result 7413 states and 19537 transitions. [2022-02-18 14:50:39,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2022-02-18 14:50:39,690 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-02-18 14:50:39,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:50:39,703 INFO L225 Difference]: With dead ends: 7413 [2022-02-18 14:50:39,703 INFO L226 Difference]: Without dead ends: 6872 [2022-02-18 14:50:39,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 223 SyntacticMatches, 19 SemanticMatches, 185 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 12146 ImplicationChecksByTransitivity, 60.6s TimeCoverageRelationStatistics Valid=2513, Invalid=30751, Unknown=58, NotChecked=1460, Total=34782 [2022-02-18 14:50:39,705 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 1795 mSDsluCounter, 11401 mSDsCounter, 0 mSdLazyCounter, 3176 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1795 SdHoareTripleChecker+Valid, 11119 SdHoareTripleChecker+Invalid, 5987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 3176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2672 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-18 14:50:39,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1795 Valid, 11119 Invalid, 5987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 3176 Invalid, 0 Unknown, 2672 Unchecked, 1.9s Time] [2022-02-18 14:50:39,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6872 states. [2022-02-18 14:50:39,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6872 to 4303. [2022-02-18 14:50:39,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4303 states, 4302 states have (on average 2.6820083682008367) internal successors, (11538), 4302 states have internal predecessors, (11538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:50:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4303 states to 4303 states and 11538 transitions. [2022-02-18 14:50:39,776 INFO L78 Accepts]: Start accepts. Automaton has 4303 states and 11538 transitions. Word has length 133 [2022-02-18 14:50:39,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:50:39,776 INFO L470 AbstractCegarLoop]: Abstraction has 4303 states and 11538 transitions. [2022-02-18 14:50:39,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:50:39,776 INFO L276 IsEmpty]: Start isEmpty. Operand 4303 states and 11538 transitions. [2022-02-18 14:50:39,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-02-18 14:50:39,783 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:50:39,783 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:50:39,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-02-18 14:50:39,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:50:39,990 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:50:39,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:50:39,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1102211354, now seen corresponding path program 5 times [2022-02-18 14:50:39,990 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:50:39,990 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924399169] [2022-02-18 14:50:39,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:50:39,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:50:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:50:41,462 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:50:41,462 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:50:41,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924399169] [2022-02-18 14:50:41,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924399169] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:50:41,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834481079] [2022-02-18 14:50:41,462 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-18 14:50:41,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:50:41,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:50:41,463 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 14:50:41,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-18 14:50:41,613 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-02-18 14:50:41,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 14:50:41,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 76 conjunts are in the unsatisfiable core [2022-02-18 14:50:41,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:50:42,559 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-18 14:50:43,085 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-18 14:50:43,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 14:50:43,633 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 18 treesize of output 20 [2022-02-18 14:50:43,877 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 7 [2022-02-18 14:50:44,617 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:50:44,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 14:50:45,664 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 (+ c_~q_front~0 1)) (and (forall ((v_ArrVal_406 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_406) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) (= (mod (+ c_~y~0 (* c_~C~0 2)) 4294967296) (mod (+ c_~C~0 c_~x~0) 4294967296))) (<= c_~n~0 0) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) is different from false [2022-02-18 14:50:45,691 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork0_#t~post1#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (and (forall ((v_ArrVal_406 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_406) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) (= (mod (+ c_~y~0 (* c_~C~0 2)) 4294967296) (mod (+ c_~C~0 c_~x~0) 4294967296))) (<= c_~n~0 0)) is different from false [2022-02-18 14:50:45,705 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (and (forall ((v_ArrVal_406 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_406) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) (= (mod (+ c_~y~0 (* c_~C~0 2)) 4294967296) (mod (+ c_~C~0 c_~x~0) 4294967296))) (<= c_~n~0 0)) is different from false [2022-02-18 14:50:49,006 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:50:49,007 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 1 case distinctions, treesize of input 102 treesize of output 78 [2022-02-18 14:50:49,017 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:50:49,017 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 263 treesize of output 247 [2022-02-18 14:50:49,022 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 206 treesize of output 194 [2022-02-18 14:50:49,034 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:50:49,035 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 219 treesize of output 211 [2022-02-18 14:50:49,040 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 176 treesize of output 152 [2022-02-18 14:50:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:50:51,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834481079] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 14:50:51,776 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 14:50:51,777 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 40, 40] total 109 [2022-02-18 14:50:51,777 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280694326] [2022-02-18 14:50:51,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 14:50:51,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2022-02-18 14:50:51,777 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:50:51,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2022-02-18 14:50:51,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=770, Invalid=10289, Unknown=83, NotChecked=630, Total=11772 [2022-02-18 14:50:51,778 INFO L87 Difference]: Start difference. First operand 4303 states and 11538 transitions. Second operand has 109 states, 109 states have (on average 3.2477064220183487) internal successors, (354), 109 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:51:12,843 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-18 14:51:50,292 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (mod (+ c_~C~0 c_~x~0) 4294967296))) (let ((.cse1 (= (mod (+ c_~y~0 (* c_~C~0 2)) 4294967296) .cse8)) (.cse2 (< c_~q_front~0 0)) (.cse3 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (.cse4 (<= c_~n~0 c_~q_front~0)) (.cse7 (mod (+ c_~C~0 c_~y~0) 4294967296)) (.cse6 (mod c_~x~0 4294967296)) (.cse0 (= c_~s~0 c_~N~0)) (.cse5 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0)))) (and (or (and .cse0 .cse1) .cse2 .cse3 .cse4) (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (and (forall ((v_ArrVal_406 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_406) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) .cse1) (<= c_~n~0 0)) (or (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse1) .cse2 .cse3 .cse4) (or .cse5 (and .cse0 (= .cse6 (mod c_~y~0 4294967296)))) (or (and .cse0 (= .cse7 .cse8)) .cse2 .cse3 .cse4) (or (and (= .cse7 .cse6) .cse0) .cse5)))) is different from false [2022-02-18 14:52:04,956 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~x~0 4294967296)) (.cse1 (= c_~s~0 c_~N~0)) (.cse0 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0)))) (and (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (and (forall ((v_ArrVal_406 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_406) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) (= (mod (+ c_~y~0 (* c_~C~0 2)) 4294967296) (mod (+ c_~C~0 c_~x~0) 4294967296))) (<= c_~n~0 0)) (or .cse0 (and .cse1 (= .cse2 (mod c_~y~0 4294967296)))) (or (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse2) .cse1) .cse0))) is different from false [2022-02-18 14:52:38,814 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~x~0 4294967296)) (.cse1 (= c_~s~0 c_~N~0)) (.cse0 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0)))) (and (or .cse0 (and .cse1 (= .cse2 (mod c_~y~0 4294967296)))) (or (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse2) .cse1) .cse0) (or (<= c_~n~0 (+ c_~q_front~0 1)) (and (forall ((v_ArrVal_406 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_406) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) (= (mod (+ c_~y~0 (* c_~C~0 2)) 4294967296) (mod (+ c_~C~0 c_~x~0) 4294967296))) (<= c_~n~0 0) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)))) is different from false [2022-02-18 14:52:39,776 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= (mod (+ c_~y~0 (* c_~C~0 2)) 4294967296) (mod (+ c_~C~0 c_~x~0) 4294967296))) (.cse3 (mod c_~x~0 4294967296)) (.cse0 (= c_~s~0 c_~N~0)) (.cse2 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0)))) (and (or (and .cse0 .cse1) (< c_~q_front~0 0) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0) (<= c_~n~0 c_~q_front~0)) (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (and (forall ((v_ArrVal_406 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_406) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) .cse1) (<= c_~n~0 0)) (or .cse2 (and .cse0 (= .cse3 (mod c_~y~0 4294967296)))) (or (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse3) .cse0) .cse2))) is different from false [2022-02-18 14:54:02,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:54:02,513 INFO L93 Difference]: Finished difference Result 11778 states and 30753 transitions. [2022-02-18 14:54:02,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2022-02-18 14:54:02,513 INFO L78 Accepts]: Start accepts. Automaton has has 109 states, 109 states have (on average 3.2477064220183487) internal successors, (354), 109 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-02-18 14:54:02,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:54:02,528 INFO L225 Difference]: With dead ends: 11778 [2022-02-18 14:54:02,529 INFO L226 Difference]: Without dead ends: 11000 [2022-02-18 14:54:02,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 234 SyntacticMatches, 30 SemanticMatches, 320 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 40394 ImplicationChecksByTransitivity, 189.4s TimeCoverageRelationStatistics Valid=7135, Invalid=91334, Unknown=469, NotChecked=4424, Total=103362 [2022-02-18 14:54:02,533 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 3657 mSDsluCounter, 11464 mSDsCounter, 0 mSdLazyCounter, 5561 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3657 SdHoareTripleChecker+Valid, 10934 SdHoareTripleChecker+Invalid, 15080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 5561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9073 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-02-18 14:54:02,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3657 Valid, 10934 Invalid, 15080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 5561 Invalid, 0 Unknown, 9073 Unchecked, 7.7s Time] [2022-02-18 14:54:02,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11000 states. [2022-02-18 14:54:02,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11000 to 4390. [2022-02-18 14:54:02,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4390 states, 4389 states have (on average 2.6903622693096376) internal successors, (11808), 4389 states have internal predecessors, (11808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:54:02,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4390 states to 4390 states and 11808 transitions. [2022-02-18 14:54:02,680 INFO L78 Accepts]: Start accepts. Automaton has 4390 states and 11808 transitions. Word has length 133 [2022-02-18 14:54:02,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:54:02,680 INFO L470 AbstractCegarLoop]: Abstraction has 4390 states and 11808 transitions. [2022-02-18 14:54:02,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 3.2477064220183487) internal successors, (354), 109 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:54:02,680 INFO L276 IsEmpty]: Start isEmpty. Operand 4390 states and 11808 transitions. [2022-02-18 14:54:02,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-02-18 14:54:02,686 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:54:02,687 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:54:02,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-02-18 14:54:02,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-02-18 14:54:02,887 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:54:02,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:54:02,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2007663518, now seen corresponding path program 6 times [2022-02-18 14:54:02,888 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:54:02,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176240853] [2022-02-18 14:54:02,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:54:02,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:54:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:54:04,328 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:54:04,328 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:54:04,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176240853] [2022-02-18 14:54:04,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176240853] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:54:04,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551523854] [2022-02-18 14:54:04,328 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-18 14:54:04,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:54:04,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:54:04,329 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 14:54:04,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-18 14:54:04,410 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-18 14:54:04,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 14:54:04,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 77 conjunts are in the unsatisfiable core [2022-02-18 14:54:04,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:54:06,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 14:54:06,416 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 18 treesize of output 20 [2022-02-18 14:54:06,754 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 14:54:06,756 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:54:06,756 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 21 treesize of output 10 [2022-02-18 14:54:07,404 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:54:07,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 14:54:08,638 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:54:08,638 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 87 treesize of output 87 [2022-02-18 14:54:08,641 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 66 treesize of output 60 [2022-02-18 14:54:15,463 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:54:15,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551523854] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 14:54:15,463 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 14:54:15,464 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 37] total 103 [2022-02-18 14:54:15,464 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333072614] [2022-02-18 14:54:15,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 14:54:15,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-02-18 14:54:15,464 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:54:15,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-02-18 14:54:15,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=806, Invalid=9688, Unknown=12, NotChecked=0, Total=10506 [2022-02-18 14:54:15,465 INFO L87 Difference]: Start difference. First operand 4390 states and 11808 transitions. Second operand has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:54:33,378 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~C~0 c_~y~0))) (let ((.cse1 (+ c_~N~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) (.cse0 (+ c_~s~0 1)) (.cse3 (< c_~q_back~0 0)) (.cse6 (= (mod .cse2 4294967296) (mod c_~x~0 4294967296))) (.cse7 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse4 (<= c_~n~0 c_~q_back~0)) (.cse5 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse2 c_~x~0) (<= c_~x~0 .cse2) (or .cse3 .cse4 .cse5 (and .cse6 (forall ((v_ArrVal_435 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_435) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))) (= c_~s~0 1) (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) (or (and .cse6 (= c_~N~0 .cse7)) .cse3 .cse4 .cse5) (= (* c_~C~0 2) c_~x~0) (<= c_~N~0 1) (= (+ c_~y~0 (* (- 1) c_~C~0)) 0) (< 0 c_~N~0) (= c_~q~0.offset 0) (or (not (<= 0 c_~q_back~0)) (not (< c_~q_back~0 c_~n~0)) (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse6) .cse5) (or .cse3 (and .cse6 (= (+ c_~s~0 .cse7) c_~N~0)) .cse4 .cse5)))) is different from false [2022-02-18 14:54:37,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:54:37,798 INFO L93 Difference]: Finished difference Result 8338 states and 21924 transitions. [2022-02-18 14:54:37,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2022-02-18 14:54:37,799 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-02-18 14:54:37,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:54:37,809 INFO L225 Difference]: With dead ends: 8338 [2022-02-18 14:54:37,809 INFO L226 Difference]: Without dead ends: 7875 [2022-02-18 14:54:37,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 211 SyntacticMatches, 18 SemanticMatches, 217 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 17767 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=3461, Invalid=43767, Unknown=82, NotChecked=432, Total=47742 [2022-02-18 14:54:37,812 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 2115 mSDsluCounter, 12287 mSDsCounter, 0 mSdLazyCounter, 2993 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2115 SdHoareTripleChecker+Valid, 11310 SdHoareTripleChecker+Invalid, 8213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 2993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5035 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-02-18 14:54:37,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2115 Valid, 11310 Invalid, 8213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 2993 Invalid, 0 Unknown, 5035 Unchecked, 2.8s Time] [2022-02-18 14:54:37,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7875 states. [2022-02-18 14:54:37,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7875 to 4726. [2022-02-18 14:54:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4726 states, 4725 states have (on average 2.678941798941799) internal successors, (12658), 4725 states have internal predecessors, (12658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:54:37,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4726 states to 4726 states and 12658 transitions. [2022-02-18 14:54:37,896 INFO L78 Accepts]: Start accepts. Automaton has 4726 states and 12658 transitions. Word has length 133 [2022-02-18 14:54:37,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:54:37,896 INFO L470 AbstractCegarLoop]: Abstraction has 4726 states and 12658 transitions. [2022-02-18 14:54:37,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:54:37,896 INFO L276 IsEmpty]: Start isEmpty. Operand 4726 states and 12658 transitions. [2022-02-18 14:54:37,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-02-18 14:54:37,903 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:54:37,903 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:54:37,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-18 14:54:38,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-02-18 14:54:38,111 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:54:38,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:54:38,111 INFO L85 PathProgramCache]: Analyzing trace with hash -725027718, now seen corresponding path program 7 times [2022-02-18 14:54:38,111 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:54:38,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247852002] [2022-02-18 14:54:38,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:54:38,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:54:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:54:39,552 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:54:39,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:54:39,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247852002] [2022-02-18 14:54:39,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247852002] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:54:39,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671363077] [2022-02-18 14:54:39,553 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-18 14:54:39,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:54:39,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:54:39,554 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 14:54:39,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-18 14:54:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:54:39,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 68 conjunts are in the unsatisfiable core [2022-02-18 14:54:39,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:54:41,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 14:54:41,515 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 18 treesize of output 20 [2022-02-18 14:54:41,848 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-02-18 14:54:41,848 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 23 treesize of output 10 [2022-02-18 14:54:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:54:42,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 14:54:43,734 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:54:43,734 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 87 treesize of output 87 [2022-02-18 14:54:43,737 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 66 treesize of output 60 [2022-02-18 14:54:50,471 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:54:50,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671363077] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 14:54:50,472 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 14:54:50,472 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 36] total 101 [2022-02-18 14:54:50,472 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797853354] [2022-02-18 14:54:50,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 14:54:50,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2022-02-18 14:54:50,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:54:50,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2022-02-18 14:54:50,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=9329, Unknown=13, NotChecked=0, Total=10100 [2022-02-18 14:54:50,473 INFO L87 Difference]: Start difference. First operand 4726 states and 12658 transitions. Second operand has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:55:07,359 WARN L228 SmtUtils]: Spent 10.16s on a formula simplification. DAG size of input: 102 DAG size of output: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-18 14:55:08,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:55:08,621 INFO L93 Difference]: Finished difference Result 6852 states and 17942 transitions. [2022-02-18 14:55:08,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-02-18 14:55:08,622 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-02-18 14:55:08,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:55:08,633 INFO L225 Difference]: With dead ends: 6852 [2022-02-18 14:55:08,633 INFO L226 Difference]: Without dead ends: 6720 [2022-02-18 14:55:08,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 223 SyntacticMatches, 12 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8330 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=2300, Invalid=23123, Unknown=17, NotChecked=0, Total=25440 [2022-02-18 14:55:08,635 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 2331 mSDsluCounter, 8889 mSDsCounter, 0 mSdLazyCounter, 2056 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2331 SdHoareTripleChecker+Valid, 8505 SdHoareTripleChecker+Invalid, 4650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2480 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-18 14:55:08,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2331 Valid, 8505 Invalid, 4650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 2056 Invalid, 0 Unknown, 2480 Unchecked, 1.1s Time] [2022-02-18 14:55:08,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6720 states. [2022-02-18 14:55:08,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6720 to 4817. [2022-02-18 14:55:08,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4817 states, 4816 states have (on average 2.677533222591362) internal successors, (12895), 4816 states have internal predecessors, (12895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:55:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4817 states to 4817 states and 12895 transitions. [2022-02-18 14:55:08,720 INFO L78 Accepts]: Start accepts. Automaton has 4817 states and 12895 transitions. Word has length 133 [2022-02-18 14:55:08,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:55:08,720 INFO L470 AbstractCegarLoop]: Abstraction has 4817 states and 12895 transitions. [2022-02-18 14:55:08,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:55:08,720 INFO L276 IsEmpty]: Start isEmpty. Operand 4817 states and 12895 transitions. [2022-02-18 14:55:08,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-02-18 14:55:08,728 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:55:08,728 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:55:08,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-18 14:55:08,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-02-18 14:55:08,945 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:55:08,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:55:08,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2026816904, now seen corresponding path program 8 times [2022-02-18 14:55:08,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:55:08,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404645686] [2022-02-18 14:55:08,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:55:08,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:55:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:55:10,416 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:55:10,416 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:55:10,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404645686] [2022-02-18 14:55:10,416 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404645686] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:55:10,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962964422] [2022-02-18 14:55:10,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-18 14:55:10,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:55:10,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:55:10,418 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 14:55:10,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-18 14:55:10,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-18 14:55:10,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 14:55:10,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 71 conjunts are in the unsatisfiable core [2022-02-18 14:55:10,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:55:12,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 14:55:12,451 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 19 treesize of output 21 [2022-02-18 14:55:12,753 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-02-18 14:55:12,753 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 24 treesize of output 10 [2022-02-18 14:55:13,413 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:55:13,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 14:55:14,736 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:55:14,737 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 87 treesize of output 87 [2022-02-18 14:55:14,740 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 66 treesize of output 60 [2022-02-18 14:55:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:55:30,974 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962964422] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 14:55:30,974 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 14:55:30,974 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 37] total 102 [2022-02-18 14:55:30,974 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124921255] [2022-02-18 14:55:30,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 14:55:30,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-02-18 14:55:30,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:55:30,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-02-18 14:55:30,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=754, Invalid=9535, Unknown=13, NotChecked=0, Total=10302 [2022-02-18 14:55:30,975 INFO L87 Difference]: Start difference. First operand 4817 states and 12895 transitions. Second operand has 102 states, 102 states have (on average 3.323529411764706) internal successors, (339), 102 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:55:40,875 WARN L228 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 86 DAG size of output: 83 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-18 14:55:48,849 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-18 14:55:59,903 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~s~0 c_~N~0)) (.cse2 (mod (+ c_~C~0 c_~x~0) 4294967296)) (.cse0 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse3 (mod (+ c_~C~0 c_~y~0) 4294967296))) (and (or .cse0 (and .cse1 (= (mod c_~y~0 4294967296) .cse2))) (or (and .cse1 (= .cse3 .cse2)) .cse0) (or (not (<= 0 c_~q_back~0)) (not (< c_~q_back~0 c_~n~0)) (and (= .cse3 (mod c_~x~0 4294967296)) (forall ((v_ArrVal_493 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_493) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)))) is different from false [2022-02-18 14:56:13,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:56:13,809 INFO L93 Difference]: Finished difference Result 11825 states and 31330 transitions. [2022-02-18 14:56:13,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2022-02-18 14:56:13,810 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 3.323529411764706) internal successors, (339), 102 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-02-18 14:56:13,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:56:13,825 INFO L225 Difference]: With dead ends: 11825 [2022-02-18 14:56:13,825 INFO L226 Difference]: Without dead ends: 11448 [2022-02-18 14:56:13,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 215 SyntacticMatches, 39 SemanticMatches, 235 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 22290 ImplicationChecksByTransitivity, 52.8s TimeCoverageRelationStatistics Valid=4127, Invalid=51217, Unknown=120, NotChecked=468, Total=55932 [2022-02-18 14:56:13,827 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 2993 mSDsluCounter, 12198 mSDsCounter, 0 mSdLazyCounter, 5569 mSolverCounterSat, 350 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2993 SdHoareTripleChecker+Valid, 11422 SdHoareTripleChecker+Invalid, 12009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 5569 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 6089 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-02-18 14:56:13,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2993 Valid, 11422 Invalid, 12009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 5569 Invalid, 1 Unknown, 6089 Unchecked, 6.3s Time] [2022-02-18 14:56:13,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11448 states. [2022-02-18 14:56:13,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11448 to 5076. [2022-02-18 14:56:13,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5076 states, 5075 states have (on average 2.6829556650246307) internal successors, (13616), 5075 states have internal predecessors, (13616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:56:13,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 13616 transitions. [2022-02-18 14:56:13,955 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 13616 transitions. Word has length 133 [2022-02-18 14:56:13,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:56:13,955 INFO L470 AbstractCegarLoop]: Abstraction has 5076 states and 13616 transitions. [2022-02-18 14:56:13,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 3.323529411764706) internal successors, (339), 102 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:56:13,955 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 13616 transitions. [2022-02-18 14:56:13,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-02-18 14:56:13,962 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:56:13,962 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:56:13,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-02-18 14:56:14,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-02-18 14:56:14,168 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:56:14,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:56:14,169 INFO L85 PathProgramCache]: Analyzing trace with hash 305725790, now seen corresponding path program 9 times [2022-02-18 14:56:14,169 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:56:14,169 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158681008] [2022-02-18 14:56:14,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:56:14,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:56:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:56:15,990 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:56:15,991 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:56:15,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158681008] [2022-02-18 14:56:15,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158681008] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:56:15,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972194527] [2022-02-18 14:56:15,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-18 14:56:15,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:56:15,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:56:15,992 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 14:56:15,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-18 14:56:16,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-18 14:56:16,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 14:56:16,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 51 conjunts are in the unsatisfiable core [2022-02-18 14:56:16,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:56:17,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 14:56:17,345 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 18 treesize of output 20 [2022-02-18 14:56:17,529 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 7 [2022-02-18 14:56:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-18 14:56:18,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 14:56:19,203 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:56:19,203 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 87 treesize of output 87 [2022-02-18 14:56:19,206 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 66 treesize of output 60 [2022-02-18 14:56:22,096 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-18 14:56:22,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972194527] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 14:56:22,096 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 14:56:22,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 29, 28] total 90 [2022-02-18 14:56:22,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479264222] [2022-02-18 14:56:22,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 14:56:22,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-02-18 14:56:22,097 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:56:22,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-02-18 14:56:22,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=431, Invalid=7571, Unknown=8, NotChecked=0, Total=8010 [2022-02-18 14:56:22,097 INFO L87 Difference]: Start difference. First operand 5076 states and 13616 transitions. Second operand has 90 states, 90 states have (on average 3.7777777777777777) internal successors, (340), 90 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:56:32,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:56:32,687 INFO L93 Difference]: Finished difference Result 7127 states and 19024 transitions. [2022-02-18 14:56:32,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-02-18 14:56:32,687 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 90 states have (on average 3.7777777777777777) internal successors, (340), 90 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-02-18 14:56:32,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:56:32,698 INFO L225 Difference]: With dead ends: 7127 [2022-02-18 14:56:32,698 INFO L226 Difference]: Without dead ends: 6755 [2022-02-18 14:56:32,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8313 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1875, Invalid=25836, Unknown=11, NotChecked=0, Total=27722 [2022-02-18 14:56:32,700 INFO L933 BasicCegarLoop]: 201 mSDtfsCounter, 2009 mSDsluCounter, 9501 mSDsCounter, 0 mSdLazyCounter, 5566 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2009 SdHoareTripleChecker+Valid, 8958 SdHoareTripleChecker+Invalid, 7318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 5566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1520 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-02-18 14:56:32,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2009 Valid, 8958 Invalid, 7318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 5566 Invalid, 0 Unknown, 1520 Unchecked, 3.1s Time] [2022-02-18 14:56:32,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6755 states. [2022-02-18 14:56:32,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6755 to 5164. [2022-02-18 14:56:32,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5164 states, 5163 states have (on average 2.6887468526050746) internal successors, (13882), 5163 states have internal predecessors, (13882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:56:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5164 states to 5164 states and 13882 transitions. [2022-02-18 14:56:32,786 INFO L78 Accepts]: Start accepts. Automaton has 5164 states and 13882 transitions. Word has length 133 [2022-02-18 14:56:32,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:56:32,786 INFO L470 AbstractCegarLoop]: Abstraction has 5164 states and 13882 transitions. [2022-02-18 14:56:32,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 3.7777777777777777) internal successors, (340), 90 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:56:32,786 INFO L276 IsEmpty]: Start isEmpty. Operand 5164 states and 13882 transitions. [2022-02-18 14:56:32,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-02-18 14:56:32,794 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:56:32,794 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:56:32,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-18 14:56:32,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-02-18 14:56:32,995 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:56:32,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:56:32,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1588361590, now seen corresponding path program 10 times [2022-02-18 14:56:32,995 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:56:32,995 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074545951] [2022-02-18 14:56:32,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:56:32,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:56:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:56:34,497 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:56:34,497 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:56:34,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074545951] [2022-02-18 14:56:34,497 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074545951] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:56:34,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7809644] [2022-02-18 14:56:34,497 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-18 14:56:34,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:56:34,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:56:34,499 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 14:56:34,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-18 14:56:34,615 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-18 14:56:34,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 14:56:34,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 65 conjunts are in the unsatisfiable core [2022-02-18 14:56:34,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:56:36,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 14:56:36,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 18 treesize of output 20 [2022-02-18 14:56:36,808 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-02-18 14:56:36,809 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 23 treesize of output 10 [2022-02-18 14:56:37,525 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:56:37,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 14:56:38,900 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:56:38,900 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 116 treesize of output 108 [2022-02-18 14:56:38,904 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 80 treesize of output 68 [2022-02-18 14:56:41,787 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:56:41,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7809644] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 14:56:41,788 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 14:56:41,788 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 37] total 104 [2022-02-18 14:56:41,788 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407081187] [2022-02-18 14:56:41,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 14:56:41,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-02-18 14:56:41,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:56:41,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-02-18 14:56:41,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=757, Invalid=9946, Unknown=9, NotChecked=0, Total=10712 [2022-02-18 14:56:41,789 INFO L87 Difference]: Start difference. First operand 5164 states and 13882 transitions. Second operand has 104 states, 104 states have (on average 3.2596153846153846) internal successors, (339), 104 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:56:53,545 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-18 14:57:03,349 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-18 14:57:05,371 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-18 14:57:07,384 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-18 14:57:13,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:57:13,601 INFO L93 Difference]: Finished difference Result 8647 states and 22989 transitions. [2022-02-18 14:57:13,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-02-18 14:57:13,601 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 3.2596153846153846) internal successors, (339), 104 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-02-18 14:57:13,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:57:13,627 INFO L225 Difference]: With dead ends: 8647 [2022-02-18 14:57:13,628 INFO L226 Difference]: Without dead ends: 8313 [2022-02-18 14:57:13,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 219 SyntacticMatches, 8 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13317 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=3043, Invalid=37532, Unknown=27, NotChecked=0, Total=40602 [2022-02-18 14:57:13,629 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 2613 mSDsluCounter, 10905 mSDsCounter, 0 mSdLazyCounter, 4096 mSolverCounterSat, 293 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2613 SdHoareTripleChecker+Valid, 10535 SdHoareTripleChecker+Invalid, 6296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 4096 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 1903 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-02-18 14:57:13,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2613 Valid, 10535 Invalid, 6296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 4096 Invalid, 4 Unknown, 1903 Unchecked, 12.1s Time] [2022-02-18 14:57:13,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8313 states. [2022-02-18 14:57:13,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8313 to 5184. [2022-02-18 14:57:13,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5184 states, 5183 states have (on average 2.687439706733552) internal successors, (13929), 5183 states have internal predecessors, (13929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:57:13,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5184 states to 5184 states and 13929 transitions. [2022-02-18 14:57:13,710 INFO L78 Accepts]: Start accepts. Automaton has 5184 states and 13929 transitions. Word has length 133 [2022-02-18 14:57:13,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:57:13,711 INFO L470 AbstractCegarLoop]: Abstraction has 5184 states and 13929 transitions. [2022-02-18 14:57:13,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 3.2596153846153846) internal successors, (339), 104 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:57:13,711 INFO L276 IsEmpty]: Start isEmpty. Operand 5184 states and 13929 transitions. [2022-02-18 14:57:13,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-02-18 14:57:13,717 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:57:13,717 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:57:13,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-02-18 14:57:13,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-02-18 14:57:13,918 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:57:13,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:57:13,918 INFO L85 PathProgramCache]: Analyzing trace with hash 393993568, now seen corresponding path program 11 times [2022-02-18 14:57:13,918 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:57:13,918 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082700672] [2022-02-18 14:57:13,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:57:13,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:57:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:57:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:57:15,765 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:57:15,765 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082700672] [2022-02-18 14:57:15,765 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082700672] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:57:15,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483704939] [2022-02-18 14:57:15,766 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-18 14:57:15,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:57:15,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:57:15,767 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 14:57:15,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-18 14:57:15,895 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-02-18 14:57:15,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 14:57:15,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 72 conjunts are in the unsatisfiable core [2022-02-18 14:57:15,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:57:17,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 14:57:17,696 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 18 treesize of output 20 [2022-02-18 14:57:17,945 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 7 [2022-02-18 14:57:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:57:18,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 14:57:19,868 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 (+ c_~q_front~0 1)) (and (= (+ c_~C~0 c_~x~0 (* (div (+ c_~C~0 c_~x~0) 4294967296) (- 4294967296))) (let ((.cse0 (* c_~C~0 2))) (+ c_~y~0 (* (div (+ c_~y~0 .cse0) 4294967296) (- 4294967296)) .cse0))) (forall ((v_ArrVal_580 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_580) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0))) (<= c_~n~0 0) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) is different from false [2022-02-18 14:57:19,894 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork0_#t~post1#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (and (= (+ c_~C~0 c_~x~0 (* (div (+ c_~C~0 c_~x~0) 4294967296) (- 4294967296))) (let ((.cse0 (* c_~C~0 2))) (+ c_~y~0 (* (div (+ c_~y~0 .cse0) 4294967296) (- 4294967296)) .cse0))) (forall ((v_ArrVal_580 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_580) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0))) (<= c_~n~0 0)) is different from false [2022-02-18 14:57:19,909 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (and (= (+ c_~C~0 c_~x~0 (* (div (+ c_~C~0 c_~x~0) 4294967296) (- 4294967296))) (let ((.cse0 (* c_~C~0 2))) (+ c_~y~0 (* (div (+ c_~y~0 .cse0) 4294967296) (- 4294967296)) .cse0))) (forall ((v_ArrVal_580 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_580) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0))) (<= c_~n~0 0)) is different from false [2022-02-18 14:57:19,924 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0) (and (forall ((~C~0 Int)) (let ((.cse0 (* 2 ~C~0))) (= (+ (* (div (+ c_~x~0 .cse0) 4294967296) (- 4294967296)) c_~x~0 .cse0) (+ c_~y~0 (* (div (+ c_~y~0 .cse0) 4294967296) (- 4294967296)) .cse0)))) (forall ((v_ArrVal_580 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_580) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)))) is different from false [2022-02-18 14:57:19,969 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:57:19,969 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 73 treesize of output 73 [2022-02-18 14:57:19,973 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 52 treesize of output 46 [2022-02-18 14:57:23,143 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:57:23,143 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483704939] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 14:57:23,143 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 14:57:23,143 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 38, 38] total 107 [2022-02-18 14:57:23,144 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270107018] [2022-02-18 14:57:23,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 14:57:23,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2022-02-18 14:57:23,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:57:23,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2022-02-18 14:57:23,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=698, Invalid=9820, Unknown=4, NotChecked=820, Total=11342 [2022-02-18 14:57:23,145 INFO L87 Difference]: Start difference. First operand 5184 states and 13929 transitions. Second operand has 107 states, 107 states have (on average 3.2523364485981308) internal successors, (348), 107 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:57:39,705 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~s~0 c_~N~0)) (.cse2 (+ (* (div c_~x~0 4294967296) (- 4294967296)) c_~x~0)) (.cse0 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0)))) (and (or .cse0 (and .cse1 (= (+ c_~C~0 c_~y~0 (* (- 4294967296) (div (+ c_~C~0 c_~y~0) 4294967296))) .cse2))) (or (and .cse1 (= (+ c_~y~0 (* (div c_~y~0 4294967296) (- 4294967296))) .cse2)) .cse0) (or (<= c_~n~0 (+ c_~q_front~0 1)) (and (= (+ c_~C~0 c_~x~0 (* (div (+ c_~C~0 c_~x~0) 4294967296) (- 4294967296))) (let ((.cse3 (* c_~C~0 2))) (+ c_~y~0 (* (div (+ c_~y~0 .cse3) 4294967296) (- 4294967296)) .cse3))) (forall ((v_ArrVal_580 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_580) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0))) (<= c_~n~0 0) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)))) is different from false [2022-02-18 14:57:51,377 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-18 14:58:03,843 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-18 14:58:05,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:58:05,571 INFO L93 Difference]: Finished difference Result 8207 states and 21877 transitions. [2022-02-18 14:58:05,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-02-18 14:58:05,572 INFO L78 Accepts]: Start accepts. Automaton has has 107 states, 107 states have (on average 3.2523364485981308) internal successors, (348), 107 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-02-18 14:58:05,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:58:05,584 INFO L225 Difference]: With dead ends: 8207 [2022-02-18 14:58:05,584 INFO L226 Difference]: Without dead ends: 7952 [2022-02-18 14:58:05,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 213 SyntacticMatches, 9 SemanticMatches, 199 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12665 ImplicationChecksByTransitivity, 38.3s TimeCoverageRelationStatistics Valid=2985, Invalid=35245, Unknown=10, NotChecked=1960, Total=40200 [2022-02-18 14:58:05,586 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 3025 mSDsluCounter, 11978 mSDsCounter, 0 mSdLazyCounter, 5900 mSolverCounterSat, 273 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3025 SdHoareTripleChecker+Valid, 11220 SdHoareTripleChecker+Invalid, 12945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 5900 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 6770 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-02-18 14:58:05,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3025 Valid, 11220 Invalid, 12945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 5900 Invalid, 2 Unknown, 6770 Unchecked, 9.3s Time] [2022-02-18 14:58:05,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7952 states. [2022-02-18 14:58:05,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7952 to 5347. [2022-02-18 14:58:05,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5347 states, 5346 states have (on average 2.6814440703329594) internal successors, (14335), 5346 states have internal predecessors, (14335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:58:05,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5347 states to 5347 states and 14335 transitions. [2022-02-18 14:58:05,674 INFO L78 Accepts]: Start accepts. Automaton has 5347 states and 14335 transitions. Word has length 133 [2022-02-18 14:58:05,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:58:05,675 INFO L470 AbstractCegarLoop]: Abstraction has 5347 states and 14335 transitions. [2022-02-18 14:58:05,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 107 states have (on average 3.2523364485981308) internal successors, (348), 107 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:58:05,675 INFO L276 IsEmpty]: Start isEmpty. Operand 5347 states and 14335 transitions. [2022-02-18 14:58:05,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-02-18 14:58:05,682 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:58:05,682 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:58:05,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-02-18 14:58:05,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:58:05,883 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:58:05,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:58:05,883 INFO L85 PathProgramCache]: Analyzing trace with hash -491151136, now seen corresponding path program 12 times [2022-02-18 14:58:05,883 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:58:05,883 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660089908] [2022-02-18 14:58:05,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:58:05,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:58:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:58:07,712 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:58:07,712 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:58:07,712 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660089908] [2022-02-18 14:58:07,712 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660089908] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:58:07,712 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009481533] [2022-02-18 14:58:07,712 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-18 14:58:07,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:58:07,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:58:07,713 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 14:58:07,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-02-18 14:58:07,828 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-18 14:58:07,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 14:58:07,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 72 conjunts are in the unsatisfiable core [2022-02-18 14:58:07,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:58:09,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 14:58:09,592 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 18 treesize of output 20 [2022-02-18 14:58:09,901 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 7 [2022-02-18 14:58:10,651 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:58:10,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 14:58:11,714 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0) (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296)) (forall ((v_ArrVal_609 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))) is different from false [2022-02-18 14:58:11,737 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork0_#t~post1#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0) (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296)) (forall ((v_ArrVal_609 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))) is different from false [2022-02-18 14:58:11,760 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0) (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296)) (forall ((v_ArrVal_609 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))) is different from false [2022-02-18 14:58:11,800 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0) (and (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse2 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse1 (+ .cse2 aux_mod_aux_mod_~C~0_30_61)) (.cse0 (* 4294967295 c_~x~0))) (or (<= (+ .cse0 c_~y~0 4294967296) .cse1) (= (+ (* (- 1) c_~y~0) .cse2 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse1 (+ .cse0 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61))))) (forall ((v_ArrVal_609 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))) is different from false [2022-02-18 14:58:11,825 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:58:11,826 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 87 treesize of output 87 [2022-02-18 14:58:11,829 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 66 treesize of output 60 [2022-02-18 14:58:15,927 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:58:15,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009481533] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 14:58:15,928 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 14:58:15,928 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 38, 37] total 108 [2022-02-18 14:58:15,928 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620927876] [2022-02-18 14:58:15,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 14:58:15,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-02-18 14:58:15,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:58:15,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-02-18 14:58:15,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=685, Invalid=10039, Unknown=4, NotChecked=828, Total=11556 [2022-02-18 14:58:15,929 INFO L87 Difference]: Start difference. First operand 5347 states and 14335 transitions. Second operand has 108 states, 108 states have (on average 3.2777777777777777) internal successors, (354), 108 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:58:43,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-18 14:58:53,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:58:53,472 INFO L93 Difference]: Finished difference Result 9155 states and 24077 transitions. [2022-02-18 14:58:53,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2022-02-18 14:58:53,472 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 108 states have (on average 3.2777777777777777) internal successors, (354), 108 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-02-18 14:58:53,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:58:53,499 INFO L225 Difference]: With dead ends: 9155 [2022-02-18 14:58:53,499 INFO L226 Difference]: Without dead ends: 8621 [2022-02-18 14:58:53,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 217 SyntacticMatches, 34 SemanticMatches, 227 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 20411 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=4123, Invalid=46287, Unknown=6, NotChecked=1796, Total=52212 [2022-02-18 14:58:53,501 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 4446 mSDsluCounter, 11990 mSDsCounter, 0 mSdLazyCounter, 6233 mSolverCounterSat, 418 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4446 SdHoareTripleChecker+Valid, 11188 SdHoareTripleChecker+Invalid, 12501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 6233 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 5849 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-02-18 14:58:53,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4446 Valid, 11188 Invalid, 12501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 6233 Invalid, 1 Unknown, 5849 Unchecked, 7.7s Time] [2022-02-18 14:58:53,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8621 states. [2022-02-18 14:58:53,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8621 to 5441. [2022-02-18 14:58:53,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5441 states, 5440 states have (on average 2.6849264705882354) internal successors, (14606), 5440 states have internal predecessors, (14606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:58:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5441 states to 5441 states and 14606 transitions. [2022-02-18 14:58:53,590 INFO L78 Accepts]: Start accepts. Automaton has 5441 states and 14606 transitions. Word has length 133 [2022-02-18 14:58:53,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:58:53,590 INFO L470 AbstractCegarLoop]: Abstraction has 5441 states and 14606 transitions. [2022-02-18 14:58:53,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 108 states have (on average 3.2777777777777777) internal successors, (354), 108 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:58:53,590 INFO L276 IsEmpty]: Start isEmpty. Operand 5441 states and 14606 transitions. [2022-02-18 14:58:53,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-02-18 14:58:53,596 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:58:53,597 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:58:53,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-02-18 14:58:53,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:58:53,797 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:58:53,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:58:53,798 INFO L85 PathProgramCache]: Analyzing trace with hash -4654400, now seen corresponding path program 13 times [2022-02-18 14:58:53,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:58:53,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051705782] [2022-02-18 14:58:53,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:58:53,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:58:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:58:55,306 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:58:55,307 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:58:55,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051705782] [2022-02-18 14:58:55,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051705782] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:58:55,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020803344] [2022-02-18 14:58:55,307 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-18 14:58:55,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:58:55,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:58:55,308 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 14:58:55,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-02-18 14:58:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:58:55,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 73 conjunts are in the unsatisfiable core [2022-02-18 14:58:55,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:58:57,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 14:58:57,407 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 18 treesize of output 20 [2022-02-18 14:58:57,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 14:58:57,839 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:58:57,839 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 19 treesize of output 10 [2022-02-18 14:58:58,412 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:58:58,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 14:58:59,554 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:58:59,554 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 87 treesize of output 87 [2022-02-18 14:58:59,558 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 66 treesize of output 60 [2022-02-18 14:59:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:59:11,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020803344] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 14:59:11,259 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 14:59:11,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 36] total 102 [2022-02-18 14:59:11,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402612410] [2022-02-18 14:59:11,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 14:59:11,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-02-18 14:59:11,259 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:59:11,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-02-18 14:59:11,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=777, Invalid=9515, Unknown=10, NotChecked=0, Total=10302 [2022-02-18 14:59:11,260 INFO L87 Difference]: Start difference. First operand 5441 states and 14606 transitions. Second operand has 102 states, 102 states have (on average 3.323529411764706) internal successors, (339), 102 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:59:18,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:59:18,049 INFO L93 Difference]: Finished difference Result 7634 states and 20305 transitions. [2022-02-18 14:59:18,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-02-18 14:59:18,049 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 3.323529411764706) internal successors, (339), 102 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-02-18 14:59:18,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:59:18,061 INFO L225 Difference]: With dead ends: 7634 [2022-02-18 14:59:18,061 INFO L226 Difference]: Without dead ends: 7337 [2022-02-18 14:59:18,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 212 SyntacticMatches, 7 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8899 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=2126, Invalid=22984, Unknown=12, NotChecked=0, Total=25122 [2022-02-18 14:59:18,063 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 1944 mSDsluCounter, 9027 mSDsCounter, 0 mSdLazyCounter, 2419 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1944 SdHoareTripleChecker+Valid, 8549 SdHoareTripleChecker+Invalid, 5215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2712 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-18 14:59:18,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1944 Valid, 8549 Invalid, 5215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2419 Invalid, 0 Unknown, 2712 Unchecked, 1.4s Time] [2022-02-18 14:59:18,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7337 states. [2022-02-18 14:59:18,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7337 to 5552. [2022-02-18 14:59:18,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5552 states, 5551 states have (on average 2.6865429652314896) internal successors, (14913), 5551 states have internal predecessors, (14913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:59:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5552 states to 5552 states and 14913 transitions. [2022-02-18 14:59:18,165 INFO L78 Accepts]: Start accepts. Automaton has 5552 states and 14913 transitions. Word has length 133 [2022-02-18 14:59:18,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:59:18,165 INFO L470 AbstractCegarLoop]: Abstraction has 5552 states and 14913 transitions. [2022-02-18 14:59:18,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 3.323529411764706) internal successors, (339), 102 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:59:18,166 INFO L276 IsEmpty]: Start isEmpty. Operand 5552 states and 14913 transitions. [2022-02-18 14:59:18,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-02-18 14:59:18,173 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:59:18,173 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:59:18,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-02-18 14:59:18,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:59:18,375 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-18 14:59:18,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:59:18,376 INFO L85 PathProgramCache]: Analyzing trace with hash 791484664, now seen corresponding path program 14 times [2022-02-18 14:59:18,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:59:18,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533425019] [2022-02-18 14:59:18,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:59:18,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:59:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:59:19,925 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:59:19,925 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:59:19,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533425019] [2022-02-18 14:59:19,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533425019] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:59:19,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852338695] [2022-02-18 14:59:19,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-18 14:59:19,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:59:19,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:59:19,926 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 14:59:19,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-02-18 14:59:20,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-18 14:59:20,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 14:59:20,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 76 conjunts are in the unsatisfiable core [2022-02-18 14:59:20,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:59:21,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 14:59:21,889 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 19 treesize of output 21 [2022-02-18 14:59:22,281 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-02-18 14:59:22,282 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 24 treesize of output 10 [2022-02-18 14:59:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:59:22,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 14:59:23,820 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 (+ c_~q_front~0 1)) (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296)) (forall ((v_ArrVal_667 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_667) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0))) (<= c_~n~0 0) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) is different from false [2022-02-18 14:59:23,845 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork0_#t~post1#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296)) (forall ((v_ArrVal_667 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_667) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0))) (<= c_~n~0 0)) is different from false [2022-02-18 14:59:23,879 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296)) (forall ((v_ArrVal_667 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_667) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0))) (<= c_~n~0 0)) is different from false [2022-02-18 14:59:23,908 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_667 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_667) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)) (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse2 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse1 (+ .cse2 aux_mod_aux_mod_~C~0_30_61)) (.cse0 (* 4294967295 c_~x~0))) (or (<= (+ .cse0 c_~y~0 4294967296) .cse1) (= (+ (* (- 1) c_~y~0) .cse2 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse1 (+ .cse0 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61)))))) (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0)) is different from false [2022-02-18 14:59:23,930 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:59:23,931 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 87 treesize of output 87 [2022-02-18 14:59:23,934 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 66 treesize of output 60 [2022-02-18 14:59:27,970 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:59:27,970 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852338695] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 14:59:27,970 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 14:59:27,970 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 38, 36] total 103 [2022-02-18 14:59:27,970 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772988453] [2022-02-18 14:59:27,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 14:59:27,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-02-18 14:59:27,971 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:59:27,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-02-18 14:59:27,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=656, Invalid=9058, Unknown=4, NotChecked=788, Total=10506 [2022-02-18 14:59:27,972 INFO L87 Difference]: Start difference. First operand 5552 states and 14913 transitions. Second operand has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:59:32,282 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296))) (.cse1 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse4 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (.cse2 (<= c_~n~0 (+ c_~q_front~0 1))) (.cse3 (<= c_~n~0 0))) (and (= c_~y~0 0) (or (and .cse0 (= c_~N~0 .cse1)) .cse2 .cse3 .cse4) (or .cse2 .cse3 (and .cse0 (= (+ c_~s~0 .cse1) c_~N~0)) .cse4) (or (and (forall ((v_ArrVal_667 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_667) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)) (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse7 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse6 (+ .cse7 aux_mod_aux_mod_~C~0_30_61)) (.cse5 (* 4294967295 c_~x~0))) (or (<= (+ .cse5 c_~y~0 4294967296) .cse6) (= (+ (* (- 1) c_~y~0) .cse7 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse6 (+ .cse5 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61)))))) (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) .cse2 .cse3) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~x~0 0))) is different from false Received shutdown request... [2022-02-18 14:59:35,708 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-18 14:59:35,708 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-18 14:59:36,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-02-18 14:59:36,920 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-02-18 14:59:36,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-02-18 14:59:36,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 212 SyntacticMatches, 8 SemanticMatches, 149 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 6787 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=1861, Invalid=19324, Unknown=5, NotChecked=1460, Total=22650 [2022-02-18 14:59:36,956 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 1933 mSDsluCounter, 6347 mSDsCounter, 0 mSdLazyCounter, 2121 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1933 SdHoareTripleChecker+Valid, 6112 SdHoareTripleChecker+Invalid, 6417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4208 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-18 14:59:36,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1933 Valid, 6112 Invalid, 6417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2121 Invalid, 0 Unknown, 4208 Unchecked, 1.4s Time] [2022-02-18 14:59:36,957 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-02-18 14:59:36,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-02-18 14:59:36,957 WARN L594 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-02-18 14:59:36,958 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-02-18 14:59:36,958 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-02-18 14:59:36,960 INFO L732 BasicCegarLoop]: Path program histogram: [14, 12, 3, 1, 1, 1] [2022-02-18 14:59:36,962 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-18 14:59:36,962 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-18 14:59:36,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 02:59:36 BasicIcfg [2022-02-18 14:59:36,968 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-18 14:59:36,968 INFO L158 Benchmark]: Toolchain (without parser) took 814049.90ms. Allocated memory was 170.9MB in the beginning and 370.1MB in the end (delta: 199.2MB). Free memory was 115.8MB in the beginning and 142.2MB in the end (delta: -26.4MB). Peak memory consumption was 173.7MB. Max. memory is 8.0GB. [2022-02-18 14:59:36,968 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 170.9MB. Free memory is still 132.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-18 14:59:36,969 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.75ms. Allocated memory was 170.9MB in the beginning and 213.9MB in the end (delta: 43.0MB). Free memory was 115.7MB in the beginning and 183.0MB in the end (delta: -67.4MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2022-02-18 14:59:36,969 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.62ms. Allocated memory is still 213.9MB. Free memory was 183.0MB in the beginning and 181.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-18 14:59:36,969 INFO L158 Benchmark]: Boogie Preprocessor took 22.63ms. Allocated memory is still 213.9MB. Free memory was 181.0MB in the beginning and 179.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-18 14:59:36,969 INFO L158 Benchmark]: RCFGBuilder took 432.14ms. Allocated memory is still 213.9MB. Free memory was 179.5MB in the beginning and 158.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-02-18 14:59:36,969 INFO L158 Benchmark]: TraceAbstraction took 813362.00ms. Allocated memory was 213.9MB in the beginning and 370.1MB in the end (delta: 156.2MB). Free memory was 158.3MB in the beginning and 142.2MB in the end (delta: 16.1MB). Peak memory consumption was 173.9MB. Max. memory is 8.0GB. [2022-02-18 14:59:36,970 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.12ms. Allocated memory is still 170.9MB. Free memory is still 132.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 199.75ms. Allocated memory was 170.9MB in the beginning and 213.9MB in the end (delta: 43.0MB). Free memory was 115.7MB in the beginning and 183.0MB in the end (delta: -67.4MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.62ms. Allocated memory is still 213.9MB. Free memory was 183.0MB in the beginning and 181.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.63ms. Allocated memory is still 213.9MB. Free memory was 181.0MB in the beginning and 179.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 432.14ms. Allocated memory is still 213.9MB. Free memory was 179.5MB in the beginning and 158.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 813362.00ms. Allocated memory was 213.9MB in the beginning and 370.1MB in the end (delta: 156.2MB). Free memory was 158.3MB in the beginning and 142.2MB in the end (delta: 16.1MB). Peak memory consumption was 173.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 159 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 813.3s, OverallIterations: 32, TraceHistogramMax: 2, PathProgramHistogramMax: 14, EmptinessCheckTime: 0.2s, AutomataDifference: 603.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 43303 SdHoareTripleChecker+Valid, 66.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43303 mSDsluCounter, 168098 SdHoareTripleChecker+Invalid, 60.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 60296 IncrementalHoareTripleChecker+Unchecked, 174652 mSDsCounter, 3559 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61505 IncrementalHoareTripleChecker+Invalid, 125369 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3559 mSolverCounterUnsat, 5927 mSDtfsCounter, 61505 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7363 GetRequests, 3785 SyntacticMatches, 282 SemanticMatches, 3296 ConstructedPredicates, 39 IntricatePredicates, 1 DeprecatedPredicates, 233096 ImplicationChecksByTransitivity, 660.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5552occurred in iteration=31, InterpolantAutomatonStates: 2099, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 31 MinimizatonAttempts, 50952 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 201.6s InterpolantComputationTime, 6190 NumberOfCodeBlocks, 6176 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 8363 ConstructedInterpolants, 1166 QuantifiedInterpolants, 192967 SizeOfPredicates, 601 NumberOfNonLiveVariables, 5169 ConjunctsInSsa, 1044 ConjunctsInUnsatCore, 66 InterpolantComputations, 15 PerfectInterpolantSequences, 57/714 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown