/usr/bin/java -Xmx16000000000 -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-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-18 10:14:52,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 10:14:52,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 10:14:52,401 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 10:14:52,401 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 10:14:52,402 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 10:14:52,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 10:14:52,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 10:14:52,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 10:14:52,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 10:14:52,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 10:14:52,406 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 10:14:52,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 10:14:52,407 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 10:14:52,408 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 10:14:52,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 10:14:52,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 10:14:52,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 10:14:52,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 10:14:52,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 10:14:52,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 10:14:52,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 10:14:52,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 10:14:52,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 10:14:52,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 10:14:52,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 10:14:52,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 10:14:52,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 10:14:52,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 10:14:52,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 10:14:52,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 10:14:52,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 10:14:52,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 10:14:52,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 10:14:52,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 10:14:52,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 10:14:52,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 10:14:52,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 10:14:52,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 10:14:52,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 10:14:52,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 10:14:52,436 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-Separate.epf [2022-01-18 10:14:52,469 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 10:14:52,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 10:14:52,469 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-18 10:14:52,469 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-18 10:14:52,470 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 10:14:52,470 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 10:14:52,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 10:14:52,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 10:14:52,471 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 10:14:52,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 10:14:52,471 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 10:14:52,471 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 10:14:52,471 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 10:14:52,471 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 10:14:52,471 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 10:14:52,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 10:14:52,472 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 10:14:52,472 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 10:14:52,472 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 10:14:52,472 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 10:14:52,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 10:14:52,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 10:14:52,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 10:14:52,472 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 10:14:52,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 10:14:52,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 10:14:52,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 10:14:52,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 10:14:52,473 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 10:14:52,473 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 10:14:52,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 10:14:52,473 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 10:14:52,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-18 10:14:52,473 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2022-01-18 10:14:52,474 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-01-18 10:14:52,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 10:14:52,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 10:14:52,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 10:14:52,667 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 10:14:52,667 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 10:14:52,668 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2022-01-18 10:14:52,720 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a544147/a87d7c174d94426286949e6d5f59eb6b/FLAG7adf7fc7e [2022-01-18 10:14:53,097 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 10:14:53,098 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2022-01-18 10:14:53,113 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a544147/a87d7c174d94426286949e6d5f59eb6b/FLAG7adf7fc7e [2022-01-18 10:14:53,452 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a544147/a87d7c174d94426286949e6d5f59eb6b [2022-01-18 10:14:53,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 10:14:53,455 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 10:14:53,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 10:14:53,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 10:14:53,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 10:14:53,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:14:53" (1/1) ... [2022-01-18 10:14:53,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@172b09d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:53, skipping insertion in model container [2022-01-18 10:14:53,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:14:53" (1/1) ... [2022-01-18 10:14:53,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 10:14:53,494 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 10:14:53,787 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i[41323,41336] [2022-01-18 10:14:53,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 10:14:53,833 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 10:14:53,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i[41323,41336] [2022-01-18 10:14:53,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 10:14:53,920 INFO L208 MainTranslator]: Completed translation [2022-01-18 10:14:53,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:53 WrapperNode [2022-01-18 10:14:53,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 10:14:53,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 10:14:53,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 10:14:53,921 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 10:14:53,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:53" (1/1) ... [2022-01-18 10:14:53,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:53" (1/1) ... [2022-01-18 10:14:53,977 INFO L137 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 186 [2022-01-18 10:14:53,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 10:14:53,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 10:14:53,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 10:14:53,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 10:14:53,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:53" (1/1) ... [2022-01-18 10:14:53,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:53" (1/1) ... [2022-01-18 10:14:53,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:53" (1/1) ... [2022-01-18 10:14:53,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:53" (1/1) ... [2022-01-18 10:14:54,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:53" (1/1) ... [2022-01-18 10:14:54,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:53" (1/1) ... [2022-01-18 10:14:54,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:53" (1/1) ... [2022-01-18 10:14:54,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 10:14:54,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 10:14:54,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 10:14:54,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 10:14:54,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:53" (1/1) ... [2022-01-18 10:14:54,033 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 10:14:54,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:14:54,069 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-18 10:14:54,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-18 10:14:54,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 10:14:54,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 10:14:54,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 10:14:54,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 10:14:54,095 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-18 10:14:54,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 10:14:54,095 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-01-18 10:14:54,096 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-01-18 10:14:54,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 10:14:54,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 10:14:54,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 10:14:54,097 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 10:14:54,213 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 10:14:54,214 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 10:14:54,381 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 10:14:54,387 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 10:14:54,387 INFO L299 CfgBuilder]: Removed 23 assume(true) statements. [2022-01-18 10:14:54,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:14:54 BoogieIcfgContainer [2022-01-18 10:14:54,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 10:14:54,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 10:14:54,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 10:14:54,392 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 10:14:54,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 10:14:53" (1/3) ... [2022-01-18 10:14:54,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f9a51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:14:54, skipping insertion in model container [2022-01-18 10:14:54,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:14:53" (2/3) ... [2022-01-18 10:14:54,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f9a51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:14:54, skipping insertion in model container [2022-01-18 10:14:54,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:14:54" (3/3) ... [2022-01-18 10:14:54,394 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_74-tricky_address1_racefree.i [2022-01-18 10:14:54,398 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-18 10:14:54,398 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 10:14:54,398 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-18 10:14:54,398 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 10:14:54,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,444 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,444 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,444 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,444 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,444 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,444 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,444 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,444 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,445 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,445 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,445 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,445 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,445 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,445 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,445 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,445 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,449 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,449 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,451 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,451 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,451 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,451 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,451 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,452 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,452 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,452 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,452 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,452 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,452 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,452 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,452 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,452 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,453 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,453 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,453 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,453 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,453 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,453 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,453 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,453 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:14:54,455 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-01-18 10:14:54,482 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 10:14:54,485 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, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 10:14:54,486 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-18 10:14:54,494 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 169 places, 197 transitions, 402 flow [2022-01-18 10:14:54,596 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3805 states, 3798 states have (on average 2.383096366508689) internal successors, (9051), 3804 states have internal predecessors, (9051), 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-01-18 10:14:54,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 3805 states, 3798 states have (on average 2.383096366508689) internal successors, (9051), 3804 states have internal predecessors, (9051), 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-01-18 10:14:54,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-18 10:14:54,615 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:14:54,615 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] [2022-01-18 10:14:54,616 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 10:14:54,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:14:54,623 INFO L85 PathProgramCache]: Analyzing trace with hash -706001553, now seen corresponding path program 1 times [2022-01-18 10:14:54,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:14:54,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258786739] [2022-01-18 10:14:54,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:54,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:14:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:54,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:14:54,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:14:54,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258786739] [2022-01-18 10:14:54,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258786739] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:14:54,782 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 10:14:54,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 10:14:54,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37939621] [2022-01-18 10:14:54,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:14:54,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-18 10:14:54,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:14:54,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-18 10:14:54,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 10:14:54,815 INFO L87 Difference]: Start difference. First operand has 3805 states, 3798 states have (on average 2.383096366508689) internal successors, (9051), 3804 states have internal predecessors, (9051), 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 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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-01-18 10:14:54,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:14:54,870 INFO L93 Difference]: Finished difference Result 3682 states and 7280 transitions. [2022-01-18 10:14:54,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-18 10:14:54,872 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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 50 [2022-01-18 10:14:54,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:14:54,894 INFO L225 Difference]: With dead ends: 3682 [2022-01-18 10:14:54,894 INFO L226 Difference]: Without dead ends: 2374 [2022-01-18 10:14:54,896 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-01-18 10:14:54,899 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:14:54,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:14:54,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2022-01-18 10:14:54,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 2374. [2022-01-18 10:14:55,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2374 states, 2367 states have (on average 1.9501478664976764) internal successors, (4616), 2373 states have internal predecessors, (4616), 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-01-18 10:14:55,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 4616 transitions. [2022-01-18 10:14:55,022 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 4616 transitions. Word has length 50 [2022-01-18 10:14:55,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:14:55,024 INFO L470 AbstractCegarLoop]: Abstraction has 2374 states and 4616 transitions. [2022-01-18 10:14:55,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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-01-18 10:14:55,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 4616 transitions. [2022-01-18 10:14:55,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-18 10:14:55,029 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:14:55,029 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] [2022-01-18 10:14:55,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 10:14:55,029 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 10:14:55,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:14:55,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1763164273, now seen corresponding path program 1 times [2022-01-18 10:14:55,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:14:55,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852552396] [2022-01-18 10:14:55,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:55,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:14:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:55,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:14:55,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:14:55,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852552396] [2022-01-18 10:14:55,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852552396] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:14:55,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 10:14:55,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-18 10:14:55,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496098248] [2022-01-18 10:14:55,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:14:55,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 10:14:55,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:14:55,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 10:14:55,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 10:14:55,088 INFO L87 Difference]: Start difference. First operand 2374 states and 4616 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-01-18 10:14:55,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:14:55,118 INFO L93 Difference]: Finished difference Result 2378 states and 4620 transitions. [2022-01-18 10:14:55,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 10:14:55,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2022-01-18 10:14:55,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:14:55,126 INFO L225 Difference]: With dead ends: 2378 [2022-01-18 10:14:55,126 INFO L226 Difference]: Without dead ends: 2378 [2022-01-18 10:14:55,127 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-01-18 10:14:55,127 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 3 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:14:55,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 312 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:14:55,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2022-01-18 10:14:55,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2375. [2022-01-18 10:14:55,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2375 states, 2368 states have (on average 1.9497466216216217) internal successors, (4617), 2374 states have internal predecessors, (4617), 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-01-18 10:14:55,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 4617 transitions. [2022-01-18 10:14:55,177 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 4617 transitions. Word has length 50 [2022-01-18 10:14:55,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:14:55,178 INFO L470 AbstractCegarLoop]: Abstraction has 2375 states and 4617 transitions. [2022-01-18 10:14:55,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-01-18 10:14:55,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 4617 transitions. [2022-01-18 10:14:55,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-18 10:14:55,181 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:14:55,182 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] [2022-01-18 10:14:55,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 10:14:55,182 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 10:14:55,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:14:55,182 INFO L85 PathProgramCache]: Analyzing trace with hash -2008438335, now seen corresponding path program 1 times [2022-01-18 10:14:55,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:14:55,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122994452] [2022-01-18 10:14:55,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:55,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:14:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:55,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:14:55,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:14:55,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122994452] [2022-01-18 10:14:55,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122994452] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:14:55,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263774243] [2022-01-18 10:14:55,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:55,252 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:14:55,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:14:55,255 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:14:55,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-18 10:14:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:55,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-18 10:14:55,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:14:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:14:55,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-18 10:14:55,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263774243] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:14:55,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-18 10:14:55,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-01-18 10:14:55,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985188273] [2022-01-18 10:14:55,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:14:55,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 10:14:55,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:14:55,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 10:14:55,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-18 10:14:55,441 INFO L87 Difference]: Start difference. First operand 2375 states and 4617 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-01-18 10:14:55,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:14:55,462 INFO L93 Difference]: Finished difference Result 2360 states and 4602 transitions. [2022-01-18 10:14:55,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 10:14:55,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 55 [2022-01-18 10:14:55,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:14:55,483 INFO L225 Difference]: With dead ends: 2360 [2022-01-18 10:14:55,483 INFO L226 Difference]: Without dead ends: 2360 [2022-01-18 10:14:55,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-18 10:14:55,484 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 65 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:14:55,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 310 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:14:55,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2022-01-18 10:14:55,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 2360. [2022-01-18 10:14:55,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2360 states, 2354 states have (on average 1.9549702633814783) internal successors, (4602), 2359 states have internal predecessors, (4602), 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-01-18 10:14:55,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 4602 transitions. [2022-01-18 10:14:55,596 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 4602 transitions. Word has length 55 [2022-01-18 10:14:55,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:14:55,597 INFO L470 AbstractCegarLoop]: Abstraction has 2360 states and 4602 transitions. [2022-01-18 10:14:55,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-01-18 10:14:55,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 4602 transitions. [2022-01-18 10:14:55,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-18 10:14:55,598 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:14:55,598 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] [2022-01-18 10:14:55,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-18 10:14:55,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:14:55,799 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 10:14:55,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:14:55,800 INFO L85 PathProgramCache]: Analyzing trace with hash -478841000, now seen corresponding path program 1 times [2022-01-18 10:14:55,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:14:55,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122546224] [2022-01-18 10:14:55,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:55,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:14:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:55,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:14:55,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:14:55,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122546224] [2022-01-18 10:14:55,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122546224] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:14:55,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9472461] [2022-01-18 10:14:55,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:55,850 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:14:55,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:14:55,853 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:14:55,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-18 10:14:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:55,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-18 10:14:55,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:14:56,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:14:56,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:14:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:14:56,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9472461] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:14:56,145 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:14:56,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-18 10:14:56,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002462287] [2022-01-18 10:14:56,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:14:56,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 10:14:56,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:14:56,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 10:14:56,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-18 10:14:56,147 INFO L87 Difference]: Start difference. First operand 2360 states and 4602 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 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-01-18 10:14:56,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:14:56,219 INFO L93 Difference]: Finished difference Result 2370 states and 4612 transitions. [2022-01-18 10:14:56,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 10:14:56,222 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 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 65 [2022-01-18 10:14:56,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:14:56,230 INFO L225 Difference]: With dead ends: 2370 [2022-01-18 10:14:56,230 INFO L226 Difference]: Without dead ends: 2370 [2022-01-18 10:14:56,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-01-18 10:14:56,233 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 18 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:14:56,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 621 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:14:56,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2022-01-18 10:14:56,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 2370. [2022-01-18 10:14:56,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2370 states, 2364 states have (on average 1.9509306260575296) internal successors, (4612), 2369 states have internal predecessors, (4612), 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-01-18 10:14:56,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 4612 transitions. [2022-01-18 10:14:56,282 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 4612 transitions. Word has length 65 [2022-01-18 10:14:56,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:14:56,282 INFO L470 AbstractCegarLoop]: Abstraction has 2370 states and 4612 transitions. [2022-01-18 10:14:56,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 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-01-18 10:14:56,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 4612 transitions. [2022-01-18 10:14:56,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-18 10:14:56,284 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:14:56,285 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:14:56,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-18 10:14:56,495 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,SelfDestructingSolverStorable3 [2022-01-18 10:14:56,496 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 10:14:56,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:14:56,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1620698456, now seen corresponding path program 2 times [2022-01-18 10:14:56,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:14:56,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888587321] [2022-01-18 10:14:56,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:56,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:14:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:56,552 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-18 10:14:56,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:14:56,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888587321] [2022-01-18 10:14:56,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888587321] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:14:56,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751714237] [2022-01-18 10:14:56,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 10:14:56,553 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:14:56,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:14:56,554 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:14:56,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-18 10:14:56,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 10:14:56,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 10:14:56,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-18 10:14:56,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:14:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:14:56,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:14:56,902 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:14:56,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751714237] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:14:56,903 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:14:56,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-01-18 10:14:56,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920803513] [2022-01-18 10:14:56,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:14:56,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-18 10:14:56,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:14:56,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-18 10:14:56,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-01-18 10:14:56,905 INFO L87 Difference]: Start difference. First operand 2370 states and 4612 transitions. Second operand has 19 states, 19 states have (on average 6.368421052631579) internal successors, (121), 19 states have internal predecessors, (121), 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-01-18 10:14:57,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:14:57,124 INFO L93 Difference]: Finished difference Result 547 states and 958 transitions. [2022-01-18 10:14:57,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-18 10:14:57,125 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.368421052631579) internal successors, (121), 19 states have internal predecessors, (121), 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 75 [2022-01-18 10:14:57,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:14:57,126 INFO L225 Difference]: With dead ends: 547 [2022-01-18 10:14:57,126 INFO L226 Difference]: Without dead ends: 361 [2022-01-18 10:14:57,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=780, Unknown=0, NotChecked=0, Total=1056 [2022-01-18 10:14:57,127 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 384 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 10:14:57,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 1425 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 10:14:57,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-01-18 10:14:57,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2022-01-18 10:14:57,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 1.6972222222222222) internal successors, (611), 360 states have internal predecessors, (611), 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-01-18 10:14:57,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 611 transitions. [2022-01-18 10:14:57,133 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 611 transitions. Word has length 75 [2022-01-18 10:14:57,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:14:57,133 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 611 transitions. [2022-01-18 10:14:57,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.368421052631579) internal successors, (121), 19 states have internal predecessors, (121), 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-01-18 10:14:57,133 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 611 transitions. [2022-01-18 10:14:57,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-18 10:14:57,134 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:14:57,134 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:14:57,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-18 10:14:57,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:14:57,347 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 10:14:57,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:14:57,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1862165553, now seen corresponding path program 1 times [2022-01-18 10:14:57,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:14:57,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491094686] [2022-01-18 10:14:57,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:57,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:14:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:14:57,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:14:57,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491094686] [2022-01-18 10:14:57,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491094686] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:14:57,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798209376] [2022-01-18 10:14:57,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:57,500 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:14:57,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:14:57,501 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:14:57,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-18 10:14:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:57,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-18 10:14:57,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:14:57,729 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:14:57,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:14:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:14:57,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798209376] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:14:57,917 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:14:57,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-01-18 10:14:57,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296043787] [2022-01-18 10:14:57,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:14:57,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-18 10:14:57,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:14:57,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-18 10:14:57,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-01-18 10:14:57,918 INFO L87 Difference]: Start difference. First operand 361 states and 611 transitions. Second operand has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 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-01-18 10:14:58,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:14:58,094 INFO L93 Difference]: Finished difference Result 376 states and 626 transitions. [2022-01-18 10:14:58,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-18 10:14:58,095 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 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 100 [2022-01-18 10:14:58,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:14:58,096 INFO L225 Difference]: With dead ends: 376 [2022-01-18 10:14:58,096 INFO L226 Difference]: Without dead ends: 376 [2022-01-18 10:14:58,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2022-01-18 10:14:58,097 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 38 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:14:58,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 421 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:14:58,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-01-18 10:14:58,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2022-01-18 10:14:58,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 375 states have (on average 1.6693333333333333) internal successors, (626), 375 states have internal predecessors, (626), 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-01-18 10:14:58,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 626 transitions. [2022-01-18 10:14:58,102 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 626 transitions. Word has length 100 [2022-01-18 10:14:58,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:14:58,102 INFO L470 AbstractCegarLoop]: Abstraction has 376 states and 626 transitions. [2022-01-18 10:14:58,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 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-01-18 10:14:58,102 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 626 transitions. [2022-01-18 10:14:58,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-01-18 10:14:58,103 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:14:58,103 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:14:58,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-18 10:14:58,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:14:58,322 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 10:14:58,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:14:58,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1793341567, now seen corresponding path program 2 times [2022-01-18 10:14:58,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:14:58,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539736753] [2022-01-18 10:14:58,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:58,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:14:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:14:58,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:14:58,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539736753] [2022-01-18 10:14:58,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539736753] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:14:58,569 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 10:14:58,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-18 10:14:58,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050138519] [2022-01-18 10:14:58,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:14:58,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-18 10:14:58,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:14:58,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-18 10:14:58,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-01-18 10:14:58,571 INFO L87 Difference]: Start difference. First operand 376 states and 626 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 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-01-18 10:14:58,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:14:58,715 INFO L93 Difference]: Finished difference Result 394 states and 640 transitions. [2022-01-18 10:14:58,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-18 10:14:58,715 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 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-01-18 10:14:58,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:14:58,716 INFO L225 Difference]: With dead ends: 394 [2022-01-18 10:14:58,717 INFO L226 Difference]: Without dead ends: 291 [2022-01-18 10:14:58,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=277, Unknown=0, NotChecked=0, Total=420 [2022-01-18 10:14:58,717 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 278 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 10:14:58,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 425 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 10:14:58,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-01-18 10:14:58,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2022-01-18 10:14:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.5724137931034483) internal successors, (456), 290 states have internal predecessors, (456), 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-01-18 10:14:58,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 456 transitions. [2022-01-18 10:14:58,721 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 456 transitions. Word has length 115 [2022-01-18 10:14:58,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:14:58,722 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 456 transitions. [2022-01-18 10:14:58,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 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-01-18 10:14:58,722 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 456 transitions. [2022-01-18 10:14:58,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 10:14:58,723 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:14:58,723 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2022-01-18 10:14:58,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 10:14:58,723 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-18 10:14:58,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:14:58,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1956800108, now seen corresponding path program 1 times [2022-01-18 10:14:58,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:14:58,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384008438] [2022-01-18 10:14:58,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:58,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:14:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:58,954 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-18 10:14:58,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:14:58,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384008438] [2022-01-18 10:14:58,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384008438] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:14:58,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65857982] [2022-01-18 10:14:58,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:14:58,955 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:14:58,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:14:58,956 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:14:58,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-18 10:14:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:14:59,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-18 10:14:59,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:14:59,091 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 7 treesize of output 6 [2022-01-18 10:14:59,430 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 10:14:59,430 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 10:14:59,470 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 13 treesize of output 15 [2022-01-18 10:14:59,594 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 13 treesize of output 15 [2022-01-18 10:14:59,626 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 14 treesize of output 10 [2022-01-18 10:14:59,658 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-18 10:14:59,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:14:59,713 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_~p~0#1.offset| Int) (v_ArrVal_224 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_224) |c_t_funThread1of1ForFork0_~p~0#1.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-18 10:14:59,751 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_~p~0#1.offset| Int) (v_ArrVal_224 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_224) |c_~#a~0.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-18 10:15:00,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 9 treesize of output 7 [2022-01-18 10:15:00,390 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-18 10:15:00,390 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 13 treesize of output 12 [2022-01-18 10:15:00,403 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 1 not checked. [2022-01-18 10:15:00,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65857982] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:15:00,403 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:15:00,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2022-01-18 10:15:00,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926503740] [2022-01-18 10:15:00,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:15:00,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-18 10:15:00,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:15:00,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-18 10:15:00,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=469, Unknown=2, NotChecked=90, Total=650 [2022-01-18 10:15:00,404 INFO L87 Difference]: Start difference. First operand 291 states and 456 transitions. Second operand has 26 states, 26 states have (on average 7.538461538461538) internal successors, (196), 26 states have internal predecessors, (196), 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-01-18 10:15:20,490 WARN L228 SmtUtils]: Spent 20.04s on a formula simplification. DAG size of input: 26 DAG size of output: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:15:40,538 WARN L228 SmtUtils]: Spent 20.02s on a formula simplification. DAG size of input: 30 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:15:50,590 WARN L228 SmtUtils]: Spent 10.02s on a formula simplification. DAG size of input: 26 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:15:50,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:15:50,776 INFO L93 Difference]: Finished difference Result 327 states and 516 transitions. [2022-01-18 10:15:50,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-18 10:15:50,776 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.538461538461538) internal successors, (196), 26 states have internal predecessors, (196), 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 124 [2022-01-18 10:15:50,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:15:50,777 INFO L225 Difference]: With dead ends: 327 [2022-01-18 10:15:50,777 INFO L226 Difference]: Without dead ends: 0 [2022-01-18 10:15:50,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 237 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 50.5s TimeCoverageRelationStatistics Valid=255, Invalid=1011, Unknown=2, NotChecked=138, Total=1406 [2022-01-18 10:15:50,778 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 226 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 10:15:50,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 662 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 0 Unknown, 172 Unchecked, 0.1s Time] [2022-01-18 10:15:50,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-18 10:15:50,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-18 10:15:50,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-01-18 10:15:50,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-18 10:15:50,778 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 124 [2022-01-18 10:15:50,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:15:50,778 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-18 10:15:50,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.538461538461538) internal successors, (196), 26 states have internal predecessors, (196), 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-01-18 10:15:50,779 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-18 10:15:50,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-18 10:15:50,780 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-18 10:15:50,781 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-01-18 10:15:50,781 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-01-18 10:15:50,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-18 10:15:50,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:15:50,993 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2022-01-18 10:15:50,994 INFO L308 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2022-01-18 10:15:50,997 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-18 10:15:50,997 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, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 10:15:50,997 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-18 10:15:51,001 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 169 places, 197 transitions, 402 flow [2022-01-18 10:15:51,010 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 683 states, 681 states have (on average 2.052863436123348) internal successors, (1398), 682 states have internal predecessors, (1398), 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-01-18 10:15:51,011 INFO L276 IsEmpty]: Start isEmpty. Operand has 683 states, 681 states have (on average 2.052863436123348) internal successors, (1398), 682 states have internal predecessors, (1398), 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-01-18 10:15:51,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-18 10:15:51,011 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:15:51,011 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] [2022-01-18 10:15:51,011 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-18 10:15:51,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:15:51,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1893756395, now seen corresponding path program 1 times [2022-01-18 10:15:51,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:15:51,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945056178] [2022-01-18 10:15:51,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:15:51,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:15:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:15:51,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 10:15:51,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:15:51,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945056178] [2022-01-18 10:15:51,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945056178] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:15:51,024 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 10:15:51,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 10:15:51,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867625637] [2022-01-18 10:15:51,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:15:51,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-18 10:15:51,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:15:51,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-18 10:15:51,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 10:15:51,026 INFO L87 Difference]: Start difference. First operand has 683 states, 681 states have (on average 2.052863436123348) internal successors, (1398), 682 states have internal predecessors, (1398), 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 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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-01-18 10:15:51,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:15:51,029 INFO L93 Difference]: Finished difference Result 672 states and 1243 transitions. [2022-01-18 10:15:51,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-18 10:15:51,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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 50 [2022-01-18 10:15:51,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:15:51,031 INFO L225 Difference]: With dead ends: 672 [2022-01-18 10:15:51,031 INFO L226 Difference]: Without dead ends: 671 [2022-01-18 10:15:51,031 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-01-18 10:15:51,033 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:15:51,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:15:51,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2022-01-18 10:15:51,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2022-01-18 10:15:51,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 668 states have (on average 1.8592814371257484) internal successors, (1242), 670 states have internal predecessors, (1242), 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-01-18 10:15:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1242 transitions. [2022-01-18 10:15:51,041 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 1242 transitions. Word has length 50 [2022-01-18 10:15:51,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:15:51,041 INFO L470 AbstractCegarLoop]: Abstraction has 671 states and 1242 transitions. [2022-01-18 10:15:51,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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-01-18 10:15:51,041 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 1242 transitions. [2022-01-18 10:15:51,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-18 10:15:51,042 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:15:51,042 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] [2022-01-18 10:15:51,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 10:15:51,042 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-18 10:15:51,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:15:51,042 INFO L85 PathProgramCache]: Analyzing trace with hash -932142378, now seen corresponding path program 1 times [2022-01-18 10:15:51,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:15:51,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020591483] [2022-01-18 10:15:51,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:15:51,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:15:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:15:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 10:15:51,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:15:51,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020591483] [2022-01-18 10:15:51,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020591483] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:15:51,056 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 10:15:51,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-18 10:15:51,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098998668] [2022-01-18 10:15:51,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:15:51,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 10:15:51,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:15:51,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 10:15:51,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 10:15:51,057 INFO L87 Difference]: Start difference. First operand 671 states and 1242 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-01-18 10:15:51,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:15:51,065 INFO L93 Difference]: Finished difference Result 675 states and 1246 transitions. [2022-01-18 10:15:51,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 10:15:51,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 50 [2022-01-18 10:15:51,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:15:51,067 INFO L225 Difference]: With dead ends: 675 [2022-01-18 10:15:51,067 INFO L226 Difference]: Without dead ends: 675 [2022-01-18 10:15:51,067 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-01-18 10:15:51,067 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 3 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:15:51,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 204 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:15:51,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-01-18 10:15:51,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 672. [2022-01-18 10:15:51,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 669 states have (on average 1.8579970104633783) internal successors, (1243), 671 states have internal predecessors, (1243), 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-01-18 10:15:51,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1243 transitions. [2022-01-18 10:15:51,076 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1243 transitions. Word has length 50 [2022-01-18 10:15:51,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:15:51,076 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 1243 transitions. [2022-01-18 10:15:51,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-01-18 10:15:51,077 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1243 transitions. [2022-01-18 10:15:51,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-18 10:15:51,077 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:15:51,077 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] [2022-01-18 10:15:51,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-18 10:15:51,077 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-18 10:15:51,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:15:51,078 INFO L85 PathProgramCache]: Analyzing trace with hash -408777690, now seen corresponding path program 1 times [2022-01-18 10:15:51,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:15:51,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320178707] [2022-01-18 10:15:51,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:15:51,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:15:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:15:51,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 10:15:51,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:15:51,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320178707] [2022-01-18 10:15:51,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320178707] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:15:51,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796303681] [2022-01-18 10:15:51,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:15:51,102 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:15:51,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:15:51,103 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:15:51,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-18 10:15:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:15:51,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-18 10:15:51,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:15:51,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 10:15:51,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:15:51,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 10:15:51,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796303681] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:15:51,270 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:15:51,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-18 10:15:51,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940468443] [2022-01-18 10:15:51,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:15:51,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 10:15:51,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:15:51,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 10:15:51,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-18 10:15:51,273 INFO L87 Difference]: Start difference. First operand 672 states and 1243 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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-01-18 10:15:51,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:15:51,303 INFO L93 Difference]: Finished difference Result 682 states and 1253 transitions. [2022-01-18 10:15:51,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 10:15:51,303 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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 55 [2022-01-18 10:15:51,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:15:51,305 INFO L225 Difference]: With dead ends: 682 [2022-01-18 10:15:51,305 INFO L226 Difference]: Without dead ends: 682 [2022-01-18 10:15:51,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-01-18 10:15:51,306 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 16 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:15:51,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 504 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:15:51,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-01-18 10:15:51,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2022-01-18 10:15:51,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 679 states have (on average 1.8453608247422681) internal successors, (1253), 681 states have internal predecessors, (1253), 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-01-18 10:15:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1253 transitions. [2022-01-18 10:15:51,314 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1253 transitions. Word has length 55 [2022-01-18 10:15:51,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:15:51,314 INFO L470 AbstractCegarLoop]: Abstraction has 682 states and 1253 transitions. [2022-01-18 10:15:51,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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-01-18 10:15:51,314 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1253 transitions. [2022-01-18 10:15:51,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-18 10:15:51,317 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:15:51,317 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:15:51,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-18 10:15:51,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:15:51,531 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-18 10:15:51,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:15:51,532 INFO L85 PathProgramCache]: Analyzing trace with hash 81295910, now seen corresponding path program 2 times [2022-01-18 10:15:51,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:15:51,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860204711] [2022-01-18 10:15:51,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:15:51,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:15:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:15:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 10:15:51,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:15:51,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860204711] [2022-01-18 10:15:51,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860204711] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:15:51,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628796460] [2022-01-18 10:15:51,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 10:15:51,573 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:15:51,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:15:51,575 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-01-18 10:15:51,576 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-01-18 10:15:51,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 10:15:51,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 10:15:51,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-18 10:15:51,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:15:51,705 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 10:15:51,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:15:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 10:15:51,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628796460] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:15:51,828 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:15:51,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-01-18 10:15:51,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702621628] [2022-01-18 10:15:51,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:15:51,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-18 10:15:51,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:15:51,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-18 10:15:51,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-01-18 10:15:51,831 INFO L87 Difference]: Start difference. First operand 682 states and 1253 transitions. Second operand has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 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-01-18 10:15:51,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:15:51,946 INFO L93 Difference]: Finished difference Result 702 states and 1273 transitions. [2022-01-18 10:15:51,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-18 10:15:51,946 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 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 65 [2022-01-18 10:15:51,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:15:51,948 INFO L225 Difference]: With dead ends: 702 [2022-01-18 10:15:51,948 INFO L226 Difference]: Without dead ends: 702 [2022-01-18 10:15:51,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2022-01-18 10:15:51,949 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 29 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:15:51,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 712 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:15:51,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-01-18 10:15:51,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2022-01-18 10:15:51,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 699 states have (on average 1.821173104434907) internal successors, (1273), 701 states have internal predecessors, (1273), 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-01-18 10:15:51,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1273 transitions. [2022-01-18 10:15:51,958 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1273 transitions. Word has length 65 [2022-01-18 10:15:51,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:15:51,958 INFO L470 AbstractCegarLoop]: Abstraction has 702 states and 1273 transitions. [2022-01-18 10:15:51,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 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-01-18 10:15:51,958 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1273 transitions. [2022-01-18 10:15:51,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-18 10:15:51,958 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:15:51,958 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 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] [2022-01-18 10:15:51,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-18 10:15:52,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:15:52,171 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-18 10:15:52,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:15:52,172 INFO L85 PathProgramCache]: Analyzing trace with hash 653252134, now seen corresponding path program 3 times [2022-01-18 10:15:52,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:15:52,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444131159] [2022-01-18 10:15:52,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:15:52,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:15:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:15:52,286 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 10:15:52,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:15:52,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444131159] [2022-01-18 10:15:52,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444131159] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:15:52,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049809434] [2022-01-18 10:15:52,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 10:15:52,287 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:15:52,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:15:52,288 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-01-18 10:15:52,288 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-01-18 10:15:52,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-01-18 10:15:52,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 10:15:52,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-18 10:15:52,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:15:52,511 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 10:15:52,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:15:52,659 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-18 10:15:52,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049809434] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:15:52,659 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:15:52,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-01-18 10:15:52,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357668858] [2022-01-18 10:15:52,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:15:52,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-18 10:15:52,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:15:52,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-18 10:15:52,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-01-18 10:15:52,661 INFO L87 Difference]: Start difference. First operand 702 states and 1273 transitions. Second operand has 23 states, 23 states have (on average 4.260869565217392) internal successors, (98), 23 states have internal predecessors, (98), 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-01-18 10:15:52,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:15:52,871 INFO L93 Difference]: Finished difference Result 717 states and 1288 transitions. [2022-01-18 10:15:52,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-18 10:15:52,871 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.260869565217392) internal successors, (98), 23 states have internal predecessors, (98), 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 85 [2022-01-18 10:15:52,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:15:52,873 INFO L225 Difference]: With dead ends: 717 [2022-01-18 10:15:52,873 INFO L226 Difference]: Without dead ends: 717 [2022-01-18 10:15:52,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2022-01-18 10:15:52,874 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 38 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:15:52,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 812 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:15:52,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-01-18 10:15:52,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2022-01-18 10:15:52,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 714 states have (on average 1.803921568627451) internal successors, (1288), 716 states have internal predecessors, (1288), 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-01-18 10:15:52,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1288 transitions. [2022-01-18 10:15:52,883 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1288 transitions. Word has length 85 [2022-01-18 10:15:52,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:15:52,883 INFO L470 AbstractCegarLoop]: Abstraction has 717 states and 1288 transitions. [2022-01-18 10:15:52,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.260869565217392) internal successors, (98), 23 states have internal predecessors, (98), 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-01-18 10:15:52,883 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1288 transitions. [2022-01-18 10:15:52,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-18 10:15:52,883 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:15:52,883 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2022-01-18 10:15:52,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-18 10:15:53,090 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,SelfDestructingSolverStorable12 [2022-01-18 10:15:53,090 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-18 10:15:53,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:15:53,090 INFO L85 PathProgramCache]: Analyzing trace with hash -2059256618, now seen corresponding path program 4 times [2022-01-18 10:15:53,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:15:53,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18065221] [2022-01-18 10:15:53,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:15:53,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:15:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 10:15:53,103 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-18 10:15:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 10:15:53,151 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-18 10:15:53,151 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-18 10:15:53,151 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-01-18 10:15:53,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-18 10:15:53,151 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2022-01-18 10:15:53,151 INFO L308 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2022-01-18 10:15:53,152 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-01-18 10:15:53,152 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-01-18 10:15:53,166 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,166 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,166 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,166 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,166 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,166 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,166 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,166 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,173 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,173 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,173 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,173 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 10:15:53,188 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-18 10:15:53,188 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 10:15:53,189 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, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 10:15:53,189 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-18 10:15:53,191 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 229 places, 269 transitions, 556 flow [2022-01-18 10:15:58,253 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 223175 states, 223156 states have (on average 3.5879474448367956) internal successors, (800672), 223174 states have internal predecessors, (800672), 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-01-18 10:15:58,642 INFO L276 IsEmpty]: Start isEmpty. Operand has 223175 states, 223156 states have (on average 3.5879474448367956) internal successors, (800672), 223174 states have internal predecessors, (800672), 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-01-18 10:15:58,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-18 10:15:58,643 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:15:58,643 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] [2022-01-18 10:15:58,643 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:15:58,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:15:58,644 INFO L85 PathProgramCache]: Analyzing trace with hash -280318449, now seen corresponding path program 1 times [2022-01-18 10:15:58,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:15:58,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413624825] [2022-01-18 10:15:58,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:15:58,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:15:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:15:58,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:15:58,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:15:58,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413624825] [2022-01-18 10:15:58,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413624825] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:15:58,657 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 10:15:58,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 10:15:58,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037568853] [2022-01-18 10:15:58,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:15:58,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-18 10:15:58,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:15:58,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-18 10:15:58,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 10:15:58,964 INFO L87 Difference]: Start difference. First operand has 223175 states, 223156 states have (on average 3.5879474448367956) internal successors, (800672), 223174 states have internal predecessors, (800672), 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 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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-01-18 10:16:01,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:16:01,078 INFO L93 Difference]: Finished difference Result 212311 states and 632376 transitions. [2022-01-18 10:16:01,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-18 10:16:01,079 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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 50 [2022-01-18 10:16:01,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:16:01,862 INFO L225 Difference]: With dead ends: 212311 [2022-01-18 10:16:01,862 INFO L226 Difference]: Without dead ends: 169553 [2022-01-18 10:16:01,862 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-01-18 10:16:01,863 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:16:01,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 223 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:16:02,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169553 states. [2022-01-18 10:16:05,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169553 to 169553. [2022-01-18 10:16:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169553 states, 169523 states have (on average 2.9614270629944017) internal successors, (502030), 169552 states have internal predecessors, (502030), 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-01-18 10:16:06,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169553 states to 169553 states and 502030 transitions. [2022-01-18 10:16:06,383 INFO L78 Accepts]: Start accepts. Automaton has 169553 states and 502030 transitions. Word has length 50 [2022-01-18 10:16:06,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:16:06,383 INFO L470 AbstractCegarLoop]: Abstraction has 169553 states and 502030 transitions. [2022-01-18 10:16:06,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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-01-18 10:16:06,383 INFO L276 IsEmpty]: Start isEmpty. Operand 169553 states and 502030 transitions. [2022-01-18 10:16:06,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-18 10:16:06,384 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:16:06,384 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] [2022-01-18 10:16:06,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-18 10:16:06,384 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:16:06,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:16:06,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2106119919, now seen corresponding path program 1 times [2022-01-18 10:16:06,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:16:06,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516044648] [2022-01-18 10:16:06,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:16:06,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:16:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:16:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:16:06,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:16:06,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516044648] [2022-01-18 10:16:06,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516044648] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:16:06,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 10:16:06,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-18 10:16:06,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138046892] [2022-01-18 10:16:06,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:16:06,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 10:16:06,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:16:06,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 10:16:06,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 10:16:06,398 INFO L87 Difference]: Start difference. First operand 169553 states and 502030 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-01-18 10:16:07,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:16:07,490 INFO L93 Difference]: Finished difference Result 169557 states and 502034 transitions. [2022-01-18 10:16:07,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 10:16:07,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2022-01-18 10:16:07,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:16:08,000 INFO L225 Difference]: With dead ends: 169557 [2022-01-18 10:16:08,000 INFO L226 Difference]: Without dead ends: 169557 [2022-01-18 10:16:08,000 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-01-18 10:16:08,000 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 3 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:16:08,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 434 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:16:08,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169557 states. [2022-01-18 10:16:11,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169557 to 169554. [2022-01-18 10:16:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169554 states, 169524 states have (on average 2.961415492791581) internal successors, (502031), 169553 states have internal predecessors, (502031), 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-01-18 10:16:12,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169554 states to 169554 states and 502031 transitions. [2022-01-18 10:16:12,378 INFO L78 Accepts]: Start accepts. Automaton has 169554 states and 502031 transitions. Word has length 50 [2022-01-18 10:16:12,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:16:12,378 INFO L470 AbstractCegarLoop]: Abstraction has 169554 states and 502031 transitions. [2022-01-18 10:16:12,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-01-18 10:16:12,378 INFO L276 IsEmpty]: Start isEmpty. Operand 169554 states and 502031 transitions. [2022-01-18 10:16:12,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-18 10:16:12,378 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:16:12,379 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] [2022-01-18 10:16:12,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-18 10:16:12,379 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:16:12,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:16:12,379 INFO L85 PathProgramCache]: Analyzing trace with hash 178238190, now seen corresponding path program 1 times [2022-01-18 10:16:12,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:16:12,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541163353] [2022-01-18 10:16:12,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:16:12,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:16:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:16:12,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:16:12,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:16:12,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541163353] [2022-01-18 10:16:12,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541163353] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:16:12,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664755059] [2022-01-18 10:16:12,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:16:12,408 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:16:12,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:16:12,410 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-01-18 10:16:12,417 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-01-18 10:16:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:16:12,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-18 10:16:12,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:16:12,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:16:12,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-18 10:16:12,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664755059] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:16:12,539 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-18 10:16:12,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-01-18 10:16:12,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192201563] [2022-01-18 10:16:12,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:16:12,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 10:16:12,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:16:12,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 10:16:12,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-18 10:16:12,540 INFO L87 Difference]: Start difference. First operand 169554 states and 502031 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-01-18 10:16:13,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:16:13,217 INFO L93 Difference]: Finished difference Result 169539 states and 502016 transitions. [2022-01-18 10:16:13,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 10:16:13,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 55 [2022-01-18 10:16:13,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:16:14,331 INFO L225 Difference]: With dead ends: 169539 [2022-01-18 10:16:14,331 INFO L226 Difference]: Without dead ends: 169539 [2022-01-18 10:16:14,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-18 10:16:14,332 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 65 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 434 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-01-18 10:16:14,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 434 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:16:14,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169539 states. [2022-01-18 10:16:17,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169539 to 169539. [2022-01-18 10:16:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169539 states, 169510 states have (on average 2.961571588696832) internal successors, (502016), 169538 states have internal predecessors, (502016), 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-01-18 10:16:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169539 states to 169539 states and 502016 transitions. [2022-01-18 10:16:18,645 INFO L78 Accepts]: Start accepts. Automaton has 169539 states and 502016 transitions. Word has length 55 [2022-01-18 10:16:18,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:16:18,645 INFO L470 AbstractCegarLoop]: Abstraction has 169539 states and 502016 transitions. [2022-01-18 10:16:18,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-01-18 10:16:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand 169539 states and 502016 transitions. [2022-01-18 10:16:18,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-18 10:16:18,647 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:16:18,647 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] [2022-01-18 10:16:18,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-01-18 10:16:18,855 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,SelfDestructingSolverStorable16 [2022-01-18 10:16:18,855 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:16:18,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:16:18,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1349753429, now seen corresponding path program 1 times [2022-01-18 10:16:18,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:16:18,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415115902] [2022-01-18 10:16:18,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:16:18,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:16:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:16:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:16:18,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:16:18,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415115902] [2022-01-18 10:16:18,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415115902] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:16:18,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110993774] [2022-01-18 10:16:18,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:16:18,887 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:16:18,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:16:18,905 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-01-18 10:16:18,928 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-01-18 10:16:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:16:18,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-18 10:16:18,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:16:19,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:16:19,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:16:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:16:19,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110993774] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:16:19,111 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:16:19,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-18 10:16:19,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026690274] [2022-01-18 10:16:19,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:16:19,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 10:16:19,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:16:19,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 10:16:19,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-18 10:16:19,112 INFO L87 Difference]: Start difference. First operand 169539 states and 502016 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 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-01-18 10:16:19,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:16:19,784 INFO L93 Difference]: Finished difference Result 169549 states and 502026 transitions. [2022-01-18 10:16:19,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 10:16:19,784 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 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 65 [2022-01-18 10:16:19,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:16:20,828 INFO L225 Difference]: With dead ends: 169549 [2022-01-18 10:16:20,829 INFO L226 Difference]: Without dead ends: 169549 [2022-01-18 10:16:20,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-01-18 10:16:20,830 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 12 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:16:20,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 866 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:16:21,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169549 states. [2022-01-18 10:16:23,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169549 to 169549. [2022-01-18 10:16:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169549 states, 169520 states have (on average 2.9614558754129305) internal successors, (502026), 169548 states have internal predecessors, (502026), 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-01-18 10:16:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169549 states to 169549 states and 502026 transitions. [2022-01-18 10:16:25,193 INFO L78 Accepts]: Start accepts. Automaton has 169549 states and 502026 transitions. Word has length 65 [2022-01-18 10:16:25,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:16:25,193 INFO L470 AbstractCegarLoop]: Abstraction has 169549 states and 502026 transitions. [2022-01-18 10:16:25,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 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-01-18 10:16:25,193 INFO L276 IsEmpty]: Start isEmpty. Operand 169549 states and 502026 transitions. [2022-01-18 10:16:25,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-18 10:16:25,197 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:16:25,197 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:16:25,213 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-01-18 10:16:25,411 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,SelfDestructingSolverStorable17 [2022-01-18 10:16:25,411 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:16:25,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:16:25,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1017331595, now seen corresponding path program 2 times [2022-01-18 10:16:25,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:16:25,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922479092] [2022-01-18 10:16:25,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:16:25,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:16:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:16:25,436 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-18 10:16:25,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:16:25,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922479092] [2022-01-18 10:16:25,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922479092] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:16:25,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253175957] [2022-01-18 10:16:25,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 10:16:25,437 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:16:25,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:16:25,438 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-01-18 10:16:25,438 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-01-18 10:16:25,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 10:16:25,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 10:16:25,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-18 10:16:25,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:16:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:16:25,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:16:25,765 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 10:16:25,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253175957] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:16:25,766 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:16:25,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-01-18 10:16:25,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088528369] [2022-01-18 10:16:25,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:16:25,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-18 10:16:25,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:16:25,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-18 10:16:25,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-01-18 10:16:25,768 INFO L87 Difference]: Start difference. First operand 169549 states and 502026 transitions. Second operand has 19 states, 19 states have (on average 6.368421052631579) internal successors, (121), 19 states have internal predecessors, (121), 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-01-18 10:16:26,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:16:26,597 INFO L93 Difference]: Finished difference Result 167986 states and 498856 transitions. [2022-01-18 10:16:26,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-18 10:16:26,598 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.368421052631579) internal successors, (121), 19 states have internal predecessors, (121), 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 75 [2022-01-18 10:16:26,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:16:27,010 INFO L225 Difference]: With dead ends: 167986 [2022-01-18 10:16:27,010 INFO L226 Difference]: Without dead ends: 167986 [2022-01-18 10:16:27,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=780, Unknown=0, NotChecked=0, Total=1056 [2022-01-18 10:16:27,011 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 391 mSDsluCounter, 2280 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 2518 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 10:16:27,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [391 Valid, 2518 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 10:16:27,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167986 states. [2022-01-18 10:16:30,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167986 to 167986. [2022-01-18 10:16:30,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167986 states, 167960 states have (on average 2.970088116218147) internal successors, (498856), 167985 states have internal predecessors, (498856), 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-01-18 10:16:31,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167986 states to 167986 states and 498856 transitions. [2022-01-18 10:16:31,232 INFO L78 Accepts]: Start accepts. Automaton has 167986 states and 498856 transitions. Word has length 75 [2022-01-18 10:16:31,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:16:31,232 INFO L470 AbstractCegarLoop]: Abstraction has 167986 states and 498856 transitions. [2022-01-18 10:16:31,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.368421052631579) internal successors, (121), 19 states have internal predecessors, (121), 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-01-18 10:16:31,232 INFO L276 IsEmpty]: Start isEmpty. Operand 167986 states and 498856 transitions. [2022-01-18 10:16:31,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-18 10:16:31,235 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:16:31,236 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:16:31,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-18 10:16:31,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:16:31,437 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:16:31,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:16:31,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1468889109, now seen corresponding path program 1 times [2022-01-18 10:16:31,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:16:31,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500496452] [2022-01-18 10:16:31,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:16:31,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:16:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:16:31,563 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:16:31,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:16:31,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500496452] [2022-01-18 10:16:31,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500496452] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:16:31,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217774317] [2022-01-18 10:16:31,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:16:31,564 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:16:31,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:16:31,580 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-01-18 10:16:31,605 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-01-18 10:16:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:16:31,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-18 10:16:31,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:16:31,826 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:16:31,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:16:31,976 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 10:16:31,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217774317] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:16:31,976 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:16:31,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-01-18 10:16:31,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25178730] [2022-01-18 10:16:31,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:16:31,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-18 10:16:31,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:16:31,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-18 10:16:31,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-01-18 10:16:31,978 INFO L87 Difference]: Start difference. First operand 167986 states and 498856 transitions. Second operand has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 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-01-18 10:16:33,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:16:33,402 INFO L93 Difference]: Finished difference Result 168001 states and 498871 transitions. [2022-01-18 10:16:33,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-18 10:16:33,403 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 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 100 [2022-01-18 10:16:33,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:16:33,779 INFO L225 Difference]: With dead ends: 168001 [2022-01-18 10:16:33,779 INFO L226 Difference]: Without dead ends: 168001 [2022-01-18 10:16:33,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2022-01-18 10:16:33,780 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 41 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:16:33,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 1302 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:16:34,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168001 states. [2022-01-18 10:16:36,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168001 to 168001. [2022-01-18 10:16:37,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168001 states, 167975 states have (on average 2.969912189313886) internal successors, (498871), 168000 states have internal predecessors, (498871), 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-01-18 10:16:37,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168001 states to 168001 states and 498871 transitions. [2022-01-18 10:16:37,972 INFO L78 Accepts]: Start accepts. Automaton has 168001 states and 498871 transitions. Word has length 100 [2022-01-18 10:16:37,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:16:37,972 INFO L470 AbstractCegarLoop]: Abstraction has 168001 states and 498871 transitions. [2022-01-18 10:16:37,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 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-01-18 10:16:37,973 INFO L276 IsEmpty]: Start isEmpty. Operand 168001 states and 498871 transitions. [2022-01-18 10:16:37,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-01-18 10:16:37,976 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:16:37,976 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 10:16:37,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-01-18 10:16:38,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:16:38,191 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:16:38,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:16:38,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1471219096, now seen corresponding path program 2 times [2022-01-18 10:16:38,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:16:38,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674826345] [2022-01-18 10:16:38,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:16:38,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:16:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:16:38,769 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:16:38,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:16:38,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674826345] [2022-01-18 10:16:38,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674826345] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 10:16:38,770 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 10:16:38,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-18 10:16:38,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338537989] [2022-01-18 10:16:38,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 10:16:38,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-18 10:16:38,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:16:38,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-18 10:16:38,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-01-18 10:16:38,771 INFO L87 Difference]: Start difference. First operand 168001 states and 498871 transitions. Second operand has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 18 states have internal predecessors, (70), 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-01-18 10:16:42,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:16:42,149 INFO L93 Difference]: Finished difference Result 315691 states and 924282 transitions. [2022-01-18 10:16:42,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-18 10:16:42,151 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 18 states have internal predecessors, (70), 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-01-18 10:16:42,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:16:43,394 INFO L225 Difference]: With dead ends: 315691 [2022-01-18 10:16:43,394 INFO L226 Difference]: Without dead ends: 300495 [2022-01-18 10:16:43,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=812, Invalid=2158, Unknown=0, NotChecked=0, Total=2970 [2022-01-18 10:16:43,395 INFO L933 BasicCegarLoop]: 539 mSDtfsCounter, 4160 mSDsluCounter, 4187 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4160 SdHoareTripleChecker+Valid, 4660 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-18 10:16:43,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4160 Valid, 4660 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-18 10:16:43,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300495 states. [2022-01-18 10:16:48,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300495 to 201345. [2022-01-18 10:16:48,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201345 states, 201319 states have (on average 2.978313025596193) internal successors, (599591), 201344 states have internal predecessors, (599591), 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-01-18 10:16:48,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201345 states to 201345 states and 599591 transitions. [2022-01-18 10:16:48,837 INFO L78 Accepts]: Start accepts. Automaton has 201345 states and 599591 transitions. Word has length 115 [2022-01-18 10:16:48,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:16:48,837 INFO L470 AbstractCegarLoop]: Abstraction has 201345 states and 599591 transitions. [2022-01-18 10:16:48,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 18 states have internal predecessors, (70), 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-01-18 10:16:48,837 INFO L276 IsEmpty]: Start isEmpty. Operand 201345 states and 599591 transitions. [2022-01-18 10:16:48,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-18 10:16:48,845 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:16:48,845 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2022-01-18 10:16:48,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-18 10:16:48,845 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:16:48,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:16:48,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1138726636, now seen corresponding path program 1 times [2022-01-18 10:16:48,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:16:48,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169320907] [2022-01-18 10:16:48,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:16:48,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:16:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:16:48,882 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:16:48,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:16:48,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169320907] [2022-01-18 10:16:48,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169320907] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:16:48,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780866559] [2022-01-18 10:16:48,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:16:48,883 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:16:48,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:16:48,887 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-01-18 10:16:48,888 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-01-18 10:16:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:16:48,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 10:16:48,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:16:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:16:49,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:16:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:16:49,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780866559] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:16:49,245 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:16:49,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-01-18 10:16:49,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004613217] [2022-01-18 10:16:49,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:16:49,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-18 10:16:49,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:16:49,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-18 10:16:49,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-01-18 10:16:49,246 INFO L87 Difference]: Start difference. First operand 201345 states and 599591 transitions. Second operand has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 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-01-18 10:16:50,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:16:50,007 INFO L93 Difference]: Finished difference Result 37958 states and 109175 transitions. [2022-01-18 10:16:50,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 10:16:50,027 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 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-01-18 10:16:50,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:16:50,111 INFO L225 Difference]: With dead ends: 37958 [2022-01-18 10:16:50,111 INFO L226 Difference]: Without dead ends: 31262 [2022-01-18 10:16:50,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2022-01-18 10:16:50,112 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 1286 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 10:16:50,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1286 Valid, 1528 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 10:16:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31262 states. [2022-01-18 10:16:50,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31262 to 31262. [2022-01-18 10:16:50,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31262 states, 31257 states have (on average 2.8655021275234347) internal successors, (89567), 31261 states have internal predecessors, (89567), 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-01-18 10:16:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31262 states to 31262 states and 89567 transitions. [2022-01-18 10:16:50,590 INFO L78 Accepts]: Start accepts. Automaton has 31262 states and 89567 transitions. Word has length 120 [2022-01-18 10:16:50,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:16:50,590 INFO L470 AbstractCegarLoop]: Abstraction has 31262 states and 89567 transitions. [2022-01-18 10:16:50,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 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-01-18 10:16:50,591 INFO L276 IsEmpty]: Start isEmpty. Operand 31262 states and 89567 transitions. [2022-01-18 10:16:50,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 10:16:50,598 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:16:50,598 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2022-01-18 10:16:50,614 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-01-18 10:16:50,811 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,SelfDestructingSolverStorable21 [2022-01-18 10:16:50,812 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:16:50,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:16:50,812 INFO L85 PathProgramCache]: Analyzing trace with hash -158885786, now seen corresponding path program 1 times [2022-01-18 10:16:50,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:16:50,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170040534] [2022-01-18 10:16:50,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:16:50,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:16:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:16:51,513 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:16:51,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:16:51,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170040534] [2022-01-18 10:16:51,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170040534] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:16:51,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179898938] [2022-01-18 10:16:51,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:16:51,514 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:16:51,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:16:51,515 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-01-18 10:16:51,516 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-01-18 10:16:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:16:51,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-18 10:16:51,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:16:51,645 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 7 treesize of output 6 [2022-01-18 10:16:51,989 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 10:16:51,989 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 10:16:52,022 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 13 treesize of output 15 [2022-01-18 10:16:52,120 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 13 treesize of output 15 [2022-01-18 10:16:52,150 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 14 treesize of output 10 [2022-01-18 10:16:52,176 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-18 10:16:52,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:16:52,229 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_637 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_637) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-18 10:16:52,234 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_637 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_637) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-18 10:16:52,938 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-18 10:16:52,956 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-18 10:16:52,956 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 13 treesize of output 12 [2022-01-18 10:16:52,967 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 1 not checked. [2022-01-18 10:16:52,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179898938] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:16:52,967 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:16:52,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 31 [2022-01-18 10:16:52,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879830991] [2022-01-18 10:16:52,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:16:52,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-18 10:16:52,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:16:52,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-18 10:16:52,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=709, Unknown=2, NotChecked=110, Total=930 [2022-01-18 10:16:52,969 INFO L87 Difference]: Start difference. First operand 31262 states and 89567 transitions. Second operand has 31 states, 31 states have (on average 6.419354838709677) internal successors, (199), 31 states have internal predecessors, (199), 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-01-18 10:17:33,082 WARN L228 SmtUtils]: Spent 40.04s on a formula simplification. DAG size of input: 36 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:18:05,887 WARN L228 SmtUtils]: Spent 32.80s on a formula simplification. DAG size of input: 27 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:18:21,955 WARN L228 SmtUtils]: Spent 16.02s on a formula simplification. DAG size of input: 38 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:18:22,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:18:22,371 INFO L93 Difference]: Finished difference Result 33950 states and 96887 transitions. [2022-01-18 10:18:22,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-18 10:18:22,371 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 6.419354838709677) internal successors, (199), 31 states have internal predecessors, (199), 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 124 [2022-01-18 10:18:22,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:18:22,428 INFO L225 Difference]: With dead ends: 33950 [2022-01-18 10:18:22,428 INFO L226 Difference]: Without dead ends: 33950 [2022-01-18 10:18:22,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 237 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 89.4s TimeCoverageRelationStatistics Valid=233, Invalid=1255, Unknown=2, NotChecked=150, Total=1640 [2022-01-18 10:18:22,429 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 407 mSDsluCounter, 2949 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 430 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-18 10:18:22,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 3147 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 528 Invalid, 0 Unknown, 430 Unchecked, 0.2s Time] [2022-01-18 10:18:22,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33950 states. [2022-01-18 10:18:22,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33950 to 31274. [2022-01-18 10:18:22,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31274 states, 31269 states have (on average 2.8652019572100165) internal successors, (89592), 31273 states have internal predecessors, (89592), 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-01-18 10:18:22,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31274 states to 31274 states and 89592 transitions. [2022-01-18 10:18:22,907 INFO L78 Accepts]: Start accepts. Automaton has 31274 states and 89592 transitions. Word has length 124 [2022-01-18 10:18:22,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:18:22,907 INFO L470 AbstractCegarLoop]: Abstraction has 31274 states and 89592 transitions. [2022-01-18 10:18:22,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 6.419354838709677) internal successors, (199), 31 states have internal predecessors, (199), 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-01-18 10:18:22,908 INFO L276 IsEmpty]: Start isEmpty. Operand 31274 states and 89592 transitions. [2022-01-18 10:18:22,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 10:18:22,914 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:18:22,914 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2022-01-18 10:18:22,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-01-18 10:18:23,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:18:23,115 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:18:23,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:18:23,115 INFO L85 PathProgramCache]: Analyzing trace with hash -380992508, now seen corresponding path program 2 times [2022-01-18 10:18:23,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:18:23,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447820629] [2022-01-18 10:18:23,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:18:23,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:18:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:18:23,269 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-18 10:18:23,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:18:23,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447820629] [2022-01-18 10:18:23,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447820629] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:18:23,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895065787] [2022-01-18 10:18:23,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 10:18:23,269 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:18:23,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:18:23,270 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-01-18 10:18:23,271 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-01-18 10:18:23,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 10:18:23,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 10:18:23,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-18 10:18:23,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:18:23,397 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 7 treesize of output 6 [2022-01-18 10:18:23,815 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 10:18:23,816 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 10:18:23,863 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 13 treesize of output 15 [2022-01-18 10:18:24,023 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 13 treesize of output 15 [2022-01-18 10:18:24,053 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 14 treesize of output 10 [2022-01-18 10:18:24,079 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-18 10:18:24,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:18:24,139 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_702) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-18 10:18:24,149 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_702) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-18 10:18:24,623 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-18 10:18:24,642 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-18 10:18:24,642 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 13 treesize of output 12 [2022-01-18 10:18:24,655 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 1 not checked. [2022-01-18 10:18:24,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895065787] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:18:24,655 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:18:24,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2022-01-18 10:18:24,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422511099] [2022-01-18 10:18:24,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:18:24,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-18 10:18:24,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:18:24,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-18 10:18:24,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=469, Unknown=2, NotChecked=90, Total=650 [2022-01-18 10:18:24,657 INFO L87 Difference]: Start difference. First operand 31274 states and 89592 transitions. Second operand has 26 states, 26 states have (on average 7.538461538461538) internal successors, (196), 26 states have internal predecessors, (196), 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-01-18 10:18:36,719 WARN L228 SmtUtils]: Spent 12.02s on a formula simplification. DAG size of input: 26 DAG size of output: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:18:56,762 WARN L228 SmtUtils]: Spent 20.02s on a formula simplification. DAG size of input: 30 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:19:12,803 WARN L228 SmtUtils]: Spent 16.02s on a formula simplification. DAG size of input: 26 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:19:13,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:19:13,729 INFO L93 Difference]: Finished difference Result 73997 states and 209084 transitions. [2022-01-18 10:19:13,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-18 10:19:13,731 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.538461538461538) internal successors, (196), 26 states have internal predecessors, (196), 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 124 [2022-01-18 10:19:13,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:19:13,859 INFO L225 Difference]: With dead ends: 73997 [2022-01-18 10:19:13,859 INFO L226 Difference]: Without dead ends: 70337 [2022-01-18 10:19:13,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 239 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 48.6s TimeCoverageRelationStatistics Valid=494, Invalid=2268, Unknown=2, NotChecked=206, Total=2970 [2022-01-18 10:19:13,861 INFO L933 BasicCegarLoop]: 390 mSDtfsCounter, 3178 mSDsluCounter, 4082 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3178 SdHoareTripleChecker+Valid, 4454 SdHoareTripleChecker+Invalid, 2826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1999 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-18 10:19:13,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3178 Valid, 4454 Invalid, 2826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 797 Invalid, 0 Unknown, 1999 Unchecked, 0.3s Time] [2022-01-18 10:19:13,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70337 states. [2022-01-18 10:19:14,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70337 to 37965. [2022-01-18 10:19:14,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37965 states, 37960 states have (on average 2.891069546891465) internal successors, (109745), 37964 states have internal predecessors, (109745), 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-01-18 10:19:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37965 states to 37965 states and 109745 transitions. [2022-01-18 10:19:14,729 INFO L78 Accepts]: Start accepts. Automaton has 37965 states and 109745 transitions. Word has length 124 [2022-01-18 10:19:14,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:19:14,729 INFO L470 AbstractCegarLoop]: Abstraction has 37965 states and 109745 transitions. [2022-01-18 10:19:14,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.538461538461538) internal successors, (196), 26 states have internal predecessors, (196), 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-01-18 10:19:14,730 INFO L276 IsEmpty]: Start isEmpty. Operand 37965 states and 109745 transitions. [2022-01-18 10:19:14,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-01-18 10:19:14,738 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:19:14,738 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2022-01-18 10:19:14,753 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-01-18 10:19:14,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:19:14,939 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:19:14,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:19:14,940 INFO L85 PathProgramCache]: Analyzing trace with hash -883571004, now seen corresponding path program 1 times [2022-01-18 10:19:14,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:19:14,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927593944] [2022-01-18 10:19:14,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:19:14,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:19:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:19:15,601 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:19:15,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:19:15,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927593944] [2022-01-18 10:19:15,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927593944] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:19:15,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384272381] [2022-01-18 10:19:15,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:19:15,601 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:19:15,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:19:15,602 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-01-18 10:19:15,603 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-01-18 10:19:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:19:15,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-18 10:19:15,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:19:15,733 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 7 treesize of output 6 [2022-01-18 10:19:16,110 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 10:19:16,110 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 10:19:16,147 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 13 treesize of output 15 [2022-01-18 10:19:16,264 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 13 treesize of output 15 [2022-01-18 10:19:16,302 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 14 treesize of output 10 [2022-01-18 10:19:16,353 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-18 10:19:16,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:19:16,409 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_767 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_767) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-18 10:19:16,414 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_767 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_767) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|))) is different from false [2022-01-18 10:19:16,948 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-18 10:19:16,972 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-18 10:19:16,972 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 13 treesize of output 12 [2022-01-18 10:19:16,988 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 2 not checked. [2022-01-18 10:19:16,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384272381] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:19:16,988 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:19:16,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 32 [2022-01-18 10:19:16,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240897026] [2022-01-18 10:19:16,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:19:16,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 10:19:16,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:19:16,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 10:19:16,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=761, Unknown=2, NotChecked=114, Total=992 [2022-01-18 10:19:16,990 INFO L87 Difference]: Start difference. First operand 37965 states and 109745 transitions. Second operand has 32 states, 32 states have (on average 6.3125) internal successors, (202), 32 states have internal predecessors, (202), 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-01-18 10:19:51,120 WARN L228 SmtUtils]: Spent 34.04s on a formula simplification. DAG size of input: 36 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:20:39,175 WARN L228 SmtUtils]: Spent 48.05s on a formula simplification. DAG size of input: 38 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:21:09,218 WARN L228 SmtUtils]: Spent 30.03s on a formula simplification. DAG size of input: 29 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:21:31,534 WARN L228 SmtUtils]: Spent 22.02s on a formula simplification. DAG size of input: 38 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:21:32,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:21:32,667 INFO L93 Difference]: Finished difference Result 66662 states and 191491 transitions. [2022-01-18 10:21:32,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-18 10:21:32,667 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.3125) internal successors, (202), 32 states have internal predecessors, (202), 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 125 [2022-01-18 10:21:32,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:21:32,790 INFO L225 Difference]: With dead ends: 66662 [2022-01-18 10:21:32,790 INFO L226 Difference]: Without dead ends: 66052 [2022-01-18 10:21:32,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 239 SyntacticMatches, 11 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 135.0s TimeCoverageRelationStatistics Valid=365, Invalid=2191, Unknown=2, NotChecked=198, Total=2756 [2022-01-18 10:21:32,791 INFO L933 BasicCegarLoop]: 470 mSDtfsCounter, 1761 mSDsluCounter, 5475 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1761 SdHoareTripleChecker+Valid, 5856 SdHoareTripleChecker+Invalid, 2590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1362 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-18 10:21:32,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1761 Valid, 5856 Invalid, 2590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1211 Invalid, 0 Unknown, 1362 Unchecked, 0.7s Time] [2022-01-18 10:21:32,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66052 states. [2022-01-18 10:21:33,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66052 to 40299. [2022-01-18 10:21:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40299 states, 40294 states have (on average 2.9051471683129) internal successors, (117060), 40298 states have internal predecessors, (117060), 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-01-18 10:21:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40299 states to 40299 states and 117060 transitions. [2022-01-18 10:21:33,734 INFO L78 Accepts]: Start accepts. Automaton has 40299 states and 117060 transitions. Word has length 125 [2022-01-18 10:21:33,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:21:33,735 INFO L470 AbstractCegarLoop]: Abstraction has 40299 states and 117060 transitions. [2022-01-18 10:21:33,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.3125) internal successors, (202), 32 states have internal predecessors, (202), 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-01-18 10:21:33,735 INFO L276 IsEmpty]: Start isEmpty. Operand 40299 states and 117060 transitions. [2022-01-18 10:21:33,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-01-18 10:21:33,744 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:21:33,744 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2022-01-18 10:21:33,761 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-01-18 10:21:33,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-01-18 10:21:33,946 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:21:33,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:21:33,947 INFO L85 PathProgramCache]: Analyzing trace with hash 821055206, now seen corresponding path program 2 times [2022-01-18 10:21:33,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:21:33,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635693658] [2022-01-18 10:21:33,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:21:33,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:21:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:21:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:21:34,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:21:34,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635693658] [2022-01-18 10:21:34,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635693658] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:21:34,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779338370] [2022-01-18 10:21:34,708 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 10:21:34,708 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:21:34,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:21:34,708 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-01-18 10:21:34,709 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-01-18 10:21:34,797 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 10:21:34,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 10:21:34,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-18 10:21:34,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:21:34,844 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 7 treesize of output 6 [2022-01-18 10:21:35,167 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 10:21:35,168 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 10:21:35,203 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 13 treesize of output 15 [2022-01-18 10:21:35,355 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 13 treesize of output 15 [2022-01-18 10:21:35,394 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 14 treesize of output 10 [2022-01-18 10:21:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-18 10:21:35,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:21:35,479 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_832) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-18 10:21:35,487 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_832) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-18 10:21:35,922 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-18 10:21:35,942 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-18 10:21:35,942 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 13 treesize of output 12 [2022-01-18 10:21:35,953 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 2 not checked. [2022-01-18 10:21:35,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779338370] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:21:35,953 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:21:35,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 32 [2022-01-18 10:21:35,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440032775] [2022-01-18 10:21:35,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:21:35,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 10:21:35,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:21:35,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 10:21:35,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=763, Unknown=2, NotChecked=114, Total=992 [2022-01-18 10:21:35,955 INFO L87 Difference]: Start difference. First operand 40299 states and 117060 transitions. Second operand has 32 states, 32 states have (on average 6.3125) internal successors, (202), 32 states have internal predecessors, (202), 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-01-18 10:22:18,086 WARN L228 SmtUtils]: Spent 42.04s on a formula simplification. DAG size of input: 36 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:23:10,137 WARN L228 SmtUtils]: Spent 52.04s on a formula simplification. DAG size of input: 38 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:23:40,180 WARN L228 SmtUtils]: Spent 30.03s on a formula simplification. DAG size of input: 29 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:24:14,312 WARN L228 SmtUtils]: Spent 34.03s on a formula simplification. DAG size of input: 32 DAG size of output: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:24:17,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:24:17,584 INFO L93 Difference]: Finished difference Result 109027 states and 310194 transitions. [2022-01-18 10:24:17,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-18 10:24:17,585 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.3125) internal successors, (202), 32 states have internal predecessors, (202), 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 125 [2022-01-18 10:24:17,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:24:17,795 INFO L225 Difference]: With dead ends: 109027 [2022-01-18 10:24:17,795 INFO L226 Difference]: Without dead ends: 97547 [2022-01-18 10:24:17,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 244 SyntacticMatches, 20 SemanticMatches, 71 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 1900 ImplicationChecksByTransitivity, 159.9s TimeCoverageRelationStatistics Valid=900, Invalid=4076, Unknown=2, NotChecked=278, Total=5256 [2022-01-18 10:24:17,797 INFO L933 BasicCegarLoop]: 722 mSDtfsCounter, 2593 mSDsluCounter, 9347 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2593 SdHoareTripleChecker+Valid, 9906 SdHoareTripleChecker+Invalid, 3754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1323 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-18 10:24:17,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2593 Valid, 9906 Invalid, 3754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2396 Invalid, 0 Unknown, 1323 Unchecked, 1.4s Time] [2022-01-18 10:24:17,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97547 states. [2022-01-18 10:24:18,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97547 to 27048. [2022-01-18 10:24:18,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27048 states, 27043 states have (on average 2.846873497762822) internal successors, (76988), 27047 states have internal predecessors, (76988), 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-01-18 10:24:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27048 states to 27048 states and 76988 transitions. [2022-01-18 10:24:18,846 INFO L78 Accepts]: Start accepts. Automaton has 27048 states and 76988 transitions. Word has length 125 [2022-01-18 10:24:18,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:24:18,846 INFO L470 AbstractCegarLoop]: Abstraction has 27048 states and 76988 transitions. [2022-01-18 10:24:18,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.3125) internal successors, (202), 32 states have internal predecessors, (202), 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-01-18 10:24:18,846 INFO L276 IsEmpty]: Start isEmpty. Operand 27048 states and 76988 transitions. [2022-01-18 10:24:18,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-01-18 10:24:18,852 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:24:18,853 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2022-01-18 10:24:18,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-01-18 10:24:19,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-01-18 10:24:19,053 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:24:19,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:24:19,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1699770320, now seen corresponding path program 1 times [2022-01-18 10:24:19,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:24:19,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342592541] [2022-01-18 10:24:19,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:24:19,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:24:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:24:19,207 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-18 10:24:19,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:24:19,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342592541] [2022-01-18 10:24:19,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342592541] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:24:19,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928305121] [2022-01-18 10:24:19,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:24:19,208 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:24:19,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:24:19,209 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:24:19,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-01-18 10:24:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:24:19,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-18 10:24:19,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:24:19,349 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 7 treesize of output 6 [2022-01-18 10:24:19,670 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 10:24:19,670 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 10:24:19,711 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 13 treesize of output 15 [2022-01-18 10:24:19,762 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 13 treesize of output 15 [2022-01-18 10:24:19,842 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 14 treesize of output 10 [2022-01-18 10:24:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-18 10:24:19,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:24:19,957 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_897 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_897) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-18 10:24:20,439 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-18 10:24:20,458 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-18 10:24:20,458 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 13 treesize of output 12 [2022-01-18 10:24:20,471 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 1 not checked. [2022-01-18 10:24:20,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928305121] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:24:20,471 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:24:20,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2022-01-18 10:24:20,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65161188] [2022-01-18 10:24:20,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:24:20,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-18 10:24:20,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:24:20,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-18 10:24:20,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=503, Unknown=1, NotChecked=46, Total=650 [2022-01-18 10:24:20,472 INFO L87 Difference]: Start difference. First operand 27048 states and 76988 transitions. Second operand has 26 states, 26 states have (on average 7.653846153846154) internal successors, (199), 26 states have internal predecessors, (199), 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-01-18 10:24:40,530 WARN L228 SmtUtils]: Spent 20.02s on a formula simplification. DAG size of input: 26 DAG size of output: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:24:41,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:24:41,209 INFO L93 Difference]: Finished difference Result 37686 states and 104985 transitions. [2022-01-18 10:24:41,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-18 10:24:41,210 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.653846153846154) internal successors, (199), 26 states have internal predecessors, (199), 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 125 [2022-01-18 10:24:41,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:24:41,267 INFO L225 Difference]: With dead ends: 37686 [2022-01-18 10:24:41,267 INFO L226 Difference]: Without dead ends: 36484 [2022-01-18 10:24:41,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 237 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=253, Invalid=940, Unknown=1, NotChecked=66, Total=1260 [2022-01-18 10:24:41,268 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 1329 mSDsluCounter, 2857 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 3186 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 495 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-18 10:24:41,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1329 Valid, 3186 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 575 Invalid, 0 Unknown, 495 Unchecked, 0.2s Time] [2022-01-18 10:24:41,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36484 states. [2022-01-18 10:24:41,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36484 to 28562. [2022-01-18 10:24:41,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28562 states, 28557 states have (on average 2.8216549357425498) internal successors, (80578), 28561 states have internal predecessors, (80578), 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-01-18 10:24:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28562 states to 28562 states and 80578 transitions. [2022-01-18 10:24:41,749 INFO L78 Accepts]: Start accepts. Automaton has 28562 states and 80578 transitions. Word has length 125 [2022-01-18 10:24:41,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:24:41,750 INFO L470 AbstractCegarLoop]: Abstraction has 28562 states and 80578 transitions. [2022-01-18 10:24:41,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.653846153846154) internal successors, (199), 26 states have internal predecessors, (199), 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-01-18 10:24:41,750 INFO L276 IsEmpty]: Start isEmpty. Operand 28562 states and 80578 transitions. [2022-01-18 10:24:41,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-18 10:24:41,764 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:24:41,765 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 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] [2022-01-18 10:24:41,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-01-18 10:24:41,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-01-18 10:24:41,965 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:24:41,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:24:41,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1468871932, now seen corresponding path program 3 times [2022-01-18 10:24:41,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:24:41,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484988064] [2022-01-18 10:24:41,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:24:41,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:24:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:24:42,200 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-18 10:24:42,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:24:42,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484988064] [2022-01-18 10:24:42,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484988064] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:24:42,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121985290] [2022-01-18 10:24:42,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 10:24:42,200 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:24:42,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:24:42,201 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:24:42,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-01-18 10:24:42,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-18 10:24:42,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 10:24:42,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-18 10:24:42,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:24:42,420 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 7 treesize of output 6 [2022-01-18 10:24:43,135 INFO L353 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-01-18 10:24:43,135 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-01-18 10:24:43,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 10:24:43,208 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-18 10:24:43,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 10:24:43,409 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-18 10:24:43,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 10:24:43,663 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-18 10:24:43,684 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 14 treesize of output 10 [2022-01-18 10:24:43,721 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-18 10:24:43,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:24:45,759 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_967 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_967) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-18 10:24:45,794 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_967 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_967) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-18 10:24:46,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-18 10:24:46,647 INFO L353 Elim1Store]: treesize reduction 15, result has 40.0 percent of original size [2022-01-18 10:24:46,648 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 26 [2022-01-18 10:24:46,668 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 14 not checked. [2022-01-18 10:24:46,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121985290] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:24:46,668 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:24:46,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 32 [2022-01-18 10:24:46,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263364868] [2022-01-18 10:24:46,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:24:46,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-18 10:24:46,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:24:46,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-18 10:24:46,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=752, Unknown=3, NotChecked=114, Total=992 [2022-01-18 10:24:46,669 INFO L87 Difference]: Start difference. First operand 28562 states and 80578 transitions. Second operand has 32 states, 32 states have (on average 7.40625) internal successors, (237), 32 states have internal predecessors, (237), 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-01-18 10:25:38,844 WARN L228 SmtUtils]: Spent 52.04s on a formula simplification. DAG size of input: 34 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:26:22,915 WARN L228 SmtUtils]: Spent 44.04s on a formula simplification. DAG size of input: 33 DAG size of output: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:26:23,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 10:26:23,409 INFO L93 Difference]: Finished difference Result 52164 states and 146818 transitions. [2022-01-18 10:26:23,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-18 10:26:23,410 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 7.40625) internal successors, (237), 32 states have internal predecessors, (237), 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 134 [2022-01-18 10:26:23,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 10:26:23,495 INFO L225 Difference]: With dead ends: 52164 [2022-01-18 10:26:23,495 INFO L226 Difference]: Without dead ends: 51308 [2022-01-18 10:26:23,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 253 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 98.7s TimeCoverageRelationStatistics Valid=355, Invalid=2200, Unknown=3, NotChecked=198, Total=2756 [2022-01-18 10:26:23,496 INFO L933 BasicCegarLoop]: 385 mSDtfsCounter, 1338 mSDsluCounter, 4862 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1338 SdHoareTripleChecker+Valid, 5247 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 845 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-18 10:26:23,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1338 Valid, 5247 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 496 Invalid, 0 Unknown, 845 Unchecked, 0.2s Time] [2022-01-18 10:26:23,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51308 states. [2022-01-18 10:26:24,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51308 to 27822. [2022-01-18 10:26:24,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27822 states, 27817 states have (on average 2.819247222921235) internal successors, (78423), 27821 states have internal predecessors, (78423), 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-01-18 10:26:24,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27822 states to 27822 states and 78423 transitions. [2022-01-18 10:26:24,189 INFO L78 Accepts]: Start accepts. Automaton has 27822 states and 78423 transitions. Word has length 134 [2022-01-18 10:26:24,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 10:26:24,189 INFO L470 AbstractCegarLoop]: Abstraction has 27822 states and 78423 transitions. [2022-01-18 10:26:24,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 7.40625) internal successors, (237), 32 states have internal predecessors, (237), 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-01-18 10:26:24,189 INFO L276 IsEmpty]: Start isEmpty. Operand 27822 states and 78423 transitions. [2022-01-18 10:26:24,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-18 10:26:24,203 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 10:26:24,203 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 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] [2022-01-18 10:26:24,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-01-18 10:26:24,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:26:24,410 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-18 10:26:24,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 10:26:24,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1969760562, now seen corresponding path program 4 times [2022-01-18 10:26:24,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 10:26:24,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599433086] [2022-01-18 10:26:24,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 10:26:24,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 10:26:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 10:26:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-18 10:26:25,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 10:26:25,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599433086] [2022-01-18 10:26:25,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599433086] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 10:26:25,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972448446] [2022-01-18 10:26:25,487 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 10:26:25,487 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 10:26:25,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 10:26:25,488 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 10:26:25,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-01-18 10:26:25,588 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 10:26:25,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 10:26:25,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-18 10:26:25,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 10:26:25,630 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 7 treesize of output 6 [2022-01-18 10:26:25,942 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 10:26:25,942 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 10:26:25,980 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 13 treesize of output 15 [2022-01-18 10:26:26,070 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 13 treesize of output 15 [2022-01-18 10:26:26,161 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 13 treesize of output 15 [2022-01-18 10:26:26,182 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 14 treesize of output 10 [2022-01-18 10:26:26,216 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-18 10:26:26,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 10:26:26,267 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1037 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1037) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-18 10:26:26,314 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1037 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1037) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-18 10:26:26,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 9 treesize of output 7 [2022-01-18 10:26:26,758 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-18 10:26:26,758 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 13 treesize of output 12 [2022-01-18 10:26:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 14 not checked. [2022-01-18 10:26:26,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972448446] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 10:26:26,770 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 10:26:26,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 11] total 35 [2022-01-18 10:26:26,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059337958] [2022-01-18 10:26:26,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 10:26:26,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-18 10:26:26,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 10:26:26,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-18 10:26:26,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=937, Unknown=2, NotChecked=126, Total=1190 [2022-01-18 10:26:26,772 INFO L87 Difference]: Start difference. First operand 27822 states and 78423 transitions. Second operand has 35 states, 35 states have (on average 6.485714285714286) internal successors, (227), 35 states have internal predecessors, (227), 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-01-18 10:27:16,308 WARN L228 SmtUtils]: Spent 49.06s on a formula simplification. DAG size of input: 44 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 10:28:12,922 WARN L228 SmtUtils]: Spent 46.05s on a formula simplification. DAG size of input: 42 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-01-18 10:28:59,289 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-18 10:28:59,289 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-01-18 10:29:00,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-01-18 10:29:00,489 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-01-18 10:29:00,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-18 10:29:00,509 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-01-18 10:29:00,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 262 SyntacticMatches, 16 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 109.1s TimeCoverageRelationStatistics Valid=676, Invalid=2522, Unknown=2, NotChecked=222, Total=3422 [2022-01-18 10:29:00,510 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 1336 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 355 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-18 10:29:00,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1336 Valid, 1719 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 582 Invalid, 0 Unknown, 355 Unchecked, 0.3s Time] [2022-01-18 10:29:00,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-18 10:29:00,510 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:306) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:242) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-18 10:29:00,512 INFO L158 Benchmark]: Toolchain (without parser) took 847056.89ms. Allocated memory was 362.8MB in the beginning and 15.5GB in the end (delta: 15.1GB). Free memory was 307.3MB in the beginning and 8.4GB in the end (delta: -8.1GB). Peak memory consumption was 6.9GB. Max. memory is 16.0GB. [2022-01-18 10:29:00,512 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 362.8MB. Free memory was 325.5MB in the beginning and 325.4MB in the end (delta: 77.3kB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 10:29:00,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.79ms. Allocated memory was 362.8MB in the beginning and 438.3MB in the end (delta: 75.5MB). Free memory was 307.0MB in the beginning and 393.2MB in the end (delta: -86.2MB). Peak memory consumption was 15.7MB. Max. memory is 16.0GB. [2022-01-18 10:29:00,512 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.04ms. Allocated memory is still 438.3MB. Free memory was 393.2MB in the beginning and 390.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 10:29:00,512 INFO L158 Benchmark]: Boogie Preprocessor took 49.40ms. Allocated memory is still 438.3MB. Free memory was 390.1MB in the beginning and 388.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 10:29:00,512 INFO L158 Benchmark]: RCFGBuilder took 361.41ms. Allocated memory is still 438.3MB. Free memory was 388.0MB in the beginning and 370.2MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2022-01-18 10:29:00,512 INFO L158 Benchmark]: TraceAbstraction took 846121.41ms. Allocated memory was 438.3MB in the beginning and 15.5GB in the end (delta: 15.0GB). Free memory was 370.2MB in the beginning and 8.4GB in the end (delta: -8.1GB). Peak memory consumption was 6.9GB. Max. memory is 16.0GB. [2022-01-18 10:29:00,513 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.11ms. Allocated memory is still 362.8MB. Free memory was 325.5MB in the beginning and 325.4MB in the end (delta: 77.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 464.79ms. Allocated memory was 362.8MB in the beginning and 438.3MB in the end (delta: 75.5MB). Free memory was 307.0MB in the beginning and 393.2MB in the end (delta: -86.2MB). Peak memory consumption was 15.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 56.04ms. Allocated memory is still 438.3MB. Free memory was 393.2MB in the beginning and 390.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 49.40ms. Allocated memory is still 438.3MB. Free memory was 390.1MB in the beginning and 388.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 361.41ms. Allocated memory is still 438.3MB. Free memory was 388.0MB in the beginning and 370.2MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 846121.41ms. Allocated memory was 438.3MB in the beginning and 15.5GB in the end (delta: 15.0GB). Free memory was 370.2MB in the beginning and 8.4GB in the end (delta: -8.1GB). Peak memory consumption was 6.9GB. Max. memory is 16.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 - 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 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:306) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown