./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/kundu1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/kundu1.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 17:34:52,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 17:34:52,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 17:34:52,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 17:34:52,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 17:34:52,811 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 17:34:52,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 17:34:52,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 17:34:52,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 17:34:52,822 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 17:34:52,823 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 17:34:52,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 17:34:52,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 17:34:52,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 17:34:52,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 17:34:52,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 17:34:52,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 17:34:52,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 17:34:52,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 17:34:52,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 17:34:52,841 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 17:34:52,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 17:34:52,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 17:34:52,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 17:34:52,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 17:34:52,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 17:34:52,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 17:34:52,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 17:34:52,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 17:34:52,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 17:34:52,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 17:34:52,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 17:34:52,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 17:34:52,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 17:34:52,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 17:34:52,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 17:34:52,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 17:34:52,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 17:34:52,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 17:34:52,857 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 17:34:52,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 17:34:52,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 17:34:52,862 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 17:34:52,891 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 17:34:52,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 17:34:52,892 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 17:34:52,892 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 17:34:52,892 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 17:34:52,892 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 17:34:52,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 17:34:52,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 17:34:52,893 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 17:34:52,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 17:34:52,893 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 17:34:52,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 17:34:52,893 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 17:34:52,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 17:34:52,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 17:34:52,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 17:34:52,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 17:34:52,894 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 17:34:52,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 17:34:52,894 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 17:34:52,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 17:34:52,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 17:34:52,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 17:34:52,895 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 17:34:52,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:34:52,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 17:34:52,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 17:34:52,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 17:34:52,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 17:34:52,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 17:34:52,896 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 17:34:52,896 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 17:34:52,896 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 17:34:52,896 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 [2022-07-19 17:34:53,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 17:34:53,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 17:34:53,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 17:34:53,156 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 17:34:53,156 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 17:34:53,157 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/kundu1.cil.c [2022-07-19 17:34:53,212 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8f7bb706/4801fe618a554b19870e40d33eb36fc3/FLAG9f6ff7dc2 [2022-07-19 17:34:53,595 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 17:34:53,596 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c [2022-07-19 17:34:53,603 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8f7bb706/4801fe618a554b19870e40d33eb36fc3/FLAG9f6ff7dc2 [2022-07-19 17:34:53,989 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8f7bb706/4801fe618a554b19870e40d33eb36fc3 [2022-07-19 17:34:53,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 17:34:53,998 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 17:34:54,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 17:34:54,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 17:34:54,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 17:34:54,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:34:53" (1/1) ... [2022-07-19 17:34:54,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201b1ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:54, skipping insertion in model container [2022-07-19 17:34:54,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:34:53" (1/1) ... [2022-07-19 17:34:54,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 17:34:54,032 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 17:34:54,156 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2022-07-19 17:34:54,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:34:54,239 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 17:34:54,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2022-07-19 17:34:54,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:34:54,281 INFO L208 MainTranslator]: Completed translation [2022-07-19 17:34:54,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:54 WrapperNode [2022-07-19 17:34:54,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 17:34:54,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 17:34:54,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 17:34:54,284 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 17:34:54,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:54" (1/1) ... [2022-07-19 17:34:54,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:54" (1/1) ... [2022-07-19 17:34:54,330 INFO L137 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 257 [2022-07-19 17:34:54,331 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 17:34:54,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 17:34:54,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 17:34:54,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 17:34:54,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:54" (1/1) ... [2022-07-19 17:34:54,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:54" (1/1) ... [2022-07-19 17:34:54,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:54" (1/1) ... [2022-07-19 17:34:54,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:54" (1/1) ... [2022-07-19 17:34:54,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:54" (1/1) ... [2022-07-19 17:34:54,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:54" (1/1) ... [2022-07-19 17:34:54,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:54" (1/1) ... [2022-07-19 17:34:54,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 17:34:54,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 17:34:54,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 17:34:54,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 17:34:54,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:54" (1/1) ... [2022-07-19 17:34:54,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:34:54,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:34:54,394 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-07-19 17:34:54,408 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-07-19 17:34:54,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 17:34:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-07-19 17:34:54,431 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-07-19 17:34:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-07-19 17:34:54,431 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-07-19 17:34:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-07-19 17:34:54,431 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-07-19 17:34:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-07-19 17:34:54,431 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-07-19 17:34:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-07-19 17:34:54,431 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-07-19 17:34:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 17:34:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-07-19 17:34:54,432 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-07-19 17:34:54,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 17:34:54,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 17:34:54,490 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 17:34:54,491 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 17:34:54,765 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 17:34:54,771 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 17:34:54,772 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-19 17:34:54,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:34:54 BoogieIcfgContainer [2022-07-19 17:34:54,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 17:34:54,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 17:34:54,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 17:34:54,783 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 17:34:54,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 05:34:53" (1/3) ... [2022-07-19 17:34:54,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b01ca49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:34:54, skipping insertion in model container [2022-07-19 17:34:54,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:54" (2/3) ... [2022-07-19 17:34:54,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b01ca49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:34:54, skipping insertion in model container [2022-07-19 17:34:54,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:34:54" (3/3) ... [2022-07-19 17:34:54,787 INFO L111 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2022-07-19 17:34:54,801 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 17:34:54,802 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 17:34:54,868 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 17:34:54,876 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7d3b26a4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@47b2af8a [2022-07-19 17:34:54,876 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 17:34:54,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 85 states have (on average 1.4941176470588236) internal successors, (127), 89 states have internal predecessors, (127), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-19 17:34:54,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-19 17:34:54,897 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:54,898 INFO L195 NwaCegarLoop]: 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] [2022-07-19 17:34:54,898 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:54,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:54,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1847694624, now seen corresponding path program 1 times [2022-07-19 17:34:54,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:54,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902457412] [2022-07-19 17:34:54,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:54,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:55,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:34:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:55,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:34:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:55,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:34:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:55,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 17:34:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:55,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 17:34:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:55,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:34:55,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:55,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902457412] [2022-07-19 17:34:55,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902457412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:55,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:34:55,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 17:34:55,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543044814] [2022-07-19 17:34:55,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:55,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:34:55,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:55,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:34:55,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:34:55,332 INFO L87 Difference]: Start difference. First operand has 108 states, 85 states have (on average 1.4941176470588236) internal successors, (127), 89 states have internal predecessors, (127), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:34:55,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:55,671 INFO L93 Difference]: Finished difference Result 317 states and 469 transitions. [2022-07-19 17:34:55,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 17:34:55,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-07-19 17:34:55,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:55,683 INFO L225 Difference]: With dead ends: 317 [2022-07-19 17:34:55,683 INFO L226 Difference]: Without dead ends: 211 [2022-07-19 17:34:55,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:34:55,690 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 295 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:55,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 656 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 17:34:55,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-19 17:34:55,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 180. [2022-07-19 17:34:55,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 146 states have (on average 1.404109589041096) internal successors, (205), 149 states have internal predecessors, (205), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-19 17:34:55,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 248 transitions. [2022-07-19 17:34:55,745 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 248 transitions. Word has length 51 [2022-07-19 17:34:55,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:55,745 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 248 transitions. [2022-07-19 17:34:55,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:34:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 248 transitions. [2022-07-19 17:34:55,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-19 17:34:55,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:55,748 INFO L195 NwaCegarLoop]: 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] [2022-07-19 17:34:55,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 17:34:55,748 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:55,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:55,749 INFO L85 PathProgramCache]: Analyzing trace with hash 682456063, now seen corresponding path program 1 times [2022-07-19 17:34:55,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:55,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435048973] [2022-07-19 17:34:55,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:55,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:55,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:34:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:55,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:34:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:55,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:34:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:55,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 17:34:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:55,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 17:34:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:55,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:34:55,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:55,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435048973] [2022-07-19 17:34:55,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435048973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:55,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:34:55,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 17:34:55,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156963209] [2022-07-19 17:34:55,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:55,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 17:34:55,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:55,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 17:34:55,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:34:55,851 INFO L87 Difference]: Start difference. First operand 180 states and 248 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:34:56,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:56,066 INFO L93 Difference]: Finished difference Result 381 states and 534 transitions. [2022-07-19 17:34:56,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 17:34:56,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-07-19 17:34:56,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:56,071 INFO L225 Difference]: With dead ends: 381 [2022-07-19 17:34:56,071 INFO L226 Difference]: Without dead ends: 211 [2022-07-19 17:34:56,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-07-19 17:34:56,074 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 117 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:56,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 637 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:34:56,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-19 17:34:56,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 183. [2022-07-19 17:34:56,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 149 states have (on average 1.389261744966443) internal successors, (207), 152 states have internal predecessors, (207), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-19 17:34:56,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 250 transitions. [2022-07-19 17:34:56,094 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 250 transitions. Word has length 51 [2022-07-19 17:34:56,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:56,095 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 250 transitions. [2022-07-19 17:34:56,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:34:56,095 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 250 transitions. [2022-07-19 17:34:56,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-19 17:34:56,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:56,097 INFO L195 NwaCegarLoop]: 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] [2022-07-19 17:34:56,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 17:34:56,097 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:56,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:56,098 INFO L85 PathProgramCache]: Analyzing trace with hash 957215677, now seen corresponding path program 1 times [2022-07-19 17:34:56,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:56,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857592247] [2022-07-19 17:34:56,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:56,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:56,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:34:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:56,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:34:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:56,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:34:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:56,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 17:34:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:56,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 17:34:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:56,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:34:56,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:56,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857592247] [2022-07-19 17:34:56,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857592247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:56,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:34:56,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 17:34:56,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969039855] [2022-07-19 17:34:56,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:56,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 17:34:56,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:56,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 17:34:56,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:34:56,198 INFO L87 Difference]: Start difference. First operand 183 states and 250 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:34:56,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:56,578 INFO L93 Difference]: Finished difference Result 719 states and 999 transitions. [2022-07-19 17:34:56,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 17:34:56,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-07-19 17:34:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:56,586 INFO L225 Difference]: With dead ends: 719 [2022-07-19 17:34:56,587 INFO L226 Difference]: Without dead ends: 546 [2022-07-19 17:34:56,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-19 17:34:56,595 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 566 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:56,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 702 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 17:34:56,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-07-19 17:34:56,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 333. [2022-07-19 17:34:56,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 273 states have (on average 1.36996336996337) internal successors, (374), 276 states have internal predecessors, (374), 39 states have call successors, (39), 21 states have call predecessors, (39), 20 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) [2022-07-19 17:34:56,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 451 transitions. [2022-07-19 17:34:56,666 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 451 transitions. Word has length 51 [2022-07-19 17:34:56,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:56,667 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 451 transitions. [2022-07-19 17:34:56,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:34:56,667 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 451 transitions. [2022-07-19 17:34:56,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-19 17:34:56,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:56,671 INFO L195 NwaCegarLoop]: 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] [2022-07-19 17:34:56,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 17:34:56,671 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:56,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:56,672 INFO L85 PathProgramCache]: Analyzing trace with hash 758872208, now seen corresponding path program 1 times [2022-07-19 17:34:56,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:56,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134720941] [2022-07-19 17:34:56,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:56,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:56,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:34:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:56,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:34:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:56,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:34:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:56,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:34:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:56,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:34:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:34:56,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:56,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134720941] [2022-07-19 17:34:56,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134720941] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:56,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:34:56,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 17:34:56,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627380057] [2022-07-19 17:34:56,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:56,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:34:56,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:56,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:34:56,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:34:56,742 INFO L87 Difference]: Start difference. First operand 333 states and 451 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:34:57,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:57,006 INFO L93 Difference]: Finished difference Result 1182 states and 1638 transitions. [2022-07-19 17:34:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 17:34:57,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-07-19 17:34:57,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:57,012 INFO L225 Difference]: With dead ends: 1182 [2022-07-19 17:34:57,012 INFO L226 Difference]: Without dead ends: 859 [2022-07-19 17:34:57,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:34:57,015 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 294 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:57,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 732 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 17:34:57,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2022-07-19 17:34:57,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 758. [2022-07-19 17:34:57,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 620 states have (on average 1.320967741935484) internal successors, (819), 623 states have internal predecessors, (819), 87 states have call successors, (87), 51 states have call predecessors, (87), 50 states have return successors, (98), 84 states have call predecessors, (98), 84 states have call successors, (98) [2022-07-19 17:34:57,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1004 transitions. [2022-07-19 17:34:57,091 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1004 transitions. Word has length 52 [2022-07-19 17:34:57,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:57,091 INFO L495 AbstractCegarLoop]: Abstraction has 758 states and 1004 transitions. [2022-07-19 17:34:57,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:34:57,092 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1004 transitions. [2022-07-19 17:34:57,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-19 17:34:57,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:57,093 INFO L195 NwaCegarLoop]: 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] [2022-07-19 17:34:57,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 17:34:57,094 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:57,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:57,094 INFO L85 PathProgramCache]: Analyzing trace with hash 701727983, now seen corresponding path program 1 times [2022-07-19 17:34:57,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:57,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277696458] [2022-07-19 17:34:57,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:57,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:57,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:34:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:57,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:34:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:57,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:34:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:57,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:34:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:57,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:34:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:57,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:34:57,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:57,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277696458] [2022-07-19 17:34:57,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277696458] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:57,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:34:57,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 17:34:57,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880751944] [2022-07-19 17:34:57,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:57,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 17:34:57,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:57,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 17:34:57,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:34:57,217 INFO L87 Difference]: Start difference. First operand 758 states and 1004 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:34:57,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:57,444 INFO L93 Difference]: Finished difference Result 1587 states and 2170 transitions. [2022-07-19 17:34:57,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 17:34:57,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-07-19 17:34:57,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:57,450 INFO L225 Difference]: With dead ends: 1587 [2022-07-19 17:34:57,450 INFO L226 Difference]: Without dead ends: 839 [2022-07-19 17:34:57,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-19 17:34:57,454 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 58 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:57,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 578 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:34:57,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2022-07-19 17:34:57,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 776. [2022-07-19 17:34:57,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 638 states have (on average 1.3056426332288402) internal successors, (833), 641 states have internal predecessors, (833), 87 states have call successors, (87), 51 states have call predecessors, (87), 50 states have return successors, (98), 84 states have call predecessors, (98), 84 states have call successors, (98) [2022-07-19 17:34:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1018 transitions. [2022-07-19 17:34:57,543 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1018 transitions. Word has length 52 [2022-07-19 17:34:57,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:57,543 INFO L495 AbstractCegarLoop]: Abstraction has 776 states and 1018 transitions. [2022-07-19 17:34:57,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:34:57,543 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1018 transitions. [2022-07-19 17:34:57,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-19 17:34:57,547 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:57,547 INFO L195 NwaCegarLoop]: 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] [2022-07-19 17:34:57,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 17:34:57,548 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:57,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:57,549 INFO L85 PathProgramCache]: Analyzing trace with hash 763767597, now seen corresponding path program 1 times [2022-07-19 17:34:57,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:57,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570350412] [2022-07-19 17:34:57,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:57,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:57,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:34:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:57,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:34:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:57,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:34:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:57,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:34:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:57,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:34:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:57,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:34:57,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:57,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570350412] [2022-07-19 17:34:57,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570350412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:57,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:34:57,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 17:34:57,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921849155] [2022-07-19 17:34:57,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:57,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:34:57,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:57,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:34:57,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:34:57,650 INFO L87 Difference]: Start difference. First operand 776 states and 1018 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-19 17:34:57,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:57,956 INFO L93 Difference]: Finished difference Result 2629 states and 3632 transitions. [2022-07-19 17:34:57,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 17:34:57,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2022-07-19 17:34:57,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:57,966 INFO L225 Difference]: With dead ends: 2629 [2022-07-19 17:34:57,967 INFO L226 Difference]: Without dead ends: 1931 [2022-07-19 17:34:57,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:34:57,970 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 272 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:57,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 646 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:34:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2022-07-19 17:34:58,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1302. [2022-07-19 17:34:58,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1073 states have (on average 1.3019571295433365) internal successors, (1397), 1076 states have internal predecessors, (1397), 143 states have call successors, (143), 86 states have call predecessors, (143), 85 states have return successors, (166), 140 states have call predecessors, (166), 140 states have call successors, (166) [2022-07-19 17:34:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1706 transitions. [2022-07-19 17:34:58,090 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1706 transitions. Word has length 52 [2022-07-19 17:34:58,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:58,091 INFO L495 AbstractCegarLoop]: Abstraction has 1302 states and 1706 transitions. [2022-07-19 17:34:58,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-19 17:34:58,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1706 transitions. [2022-07-19 17:34:58,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-19 17:34:58,092 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:58,092 INFO L195 NwaCegarLoop]: 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] [2022-07-19 17:34:58,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 17:34:58,093 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:58,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:58,093 INFO L85 PathProgramCache]: Analyzing trace with hash -938478105, now seen corresponding path program 1 times [2022-07-19 17:34:58,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:58,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072188877] [2022-07-19 17:34:58,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:58,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:58,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:34:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:58,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:34:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:58,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:34:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:58,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:34:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:58,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:34:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:58,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:34:58,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:58,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072188877] [2022-07-19 17:34:58,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072188877] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:58,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:34:58,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 17:34:58,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217165500] [2022-07-19 17:34:58,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:58,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 17:34:58,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:58,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 17:34:58,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:34:58,152 INFO L87 Difference]: Start difference. First operand 1302 states and 1706 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-19 17:34:58,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:58,438 INFO L93 Difference]: Finished difference Result 2502 states and 3310 transitions. [2022-07-19 17:34:58,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 17:34:58,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2022-07-19 17:34:58,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:58,446 INFO L225 Difference]: With dead ends: 2502 [2022-07-19 17:34:58,446 INFO L226 Difference]: Without dead ends: 1573 [2022-07-19 17:34:58,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:34:58,449 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 505 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:58,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 606 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 17:34:58,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2022-07-19 17:34:58,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1462. [2022-07-19 17:34:58,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 1207 states have (on average 1.2999171499585749) internal successors, (1569), 1210 states have internal predecessors, (1569), 159 states have call successors, (159), 96 states have call predecessors, (159), 95 states have return successors, (184), 156 states have call predecessors, (184), 156 states have call successors, (184) [2022-07-19 17:34:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 1912 transitions. [2022-07-19 17:34:58,554 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 1912 transitions. Word has length 60 [2022-07-19 17:34:58,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:58,554 INFO L495 AbstractCegarLoop]: Abstraction has 1462 states and 1912 transitions. [2022-07-19 17:34:58,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-19 17:34:58,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1912 transitions. [2022-07-19 17:34:58,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-19 17:34:58,555 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:58,556 INFO L195 NwaCegarLoop]: 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] [2022-07-19 17:34:58,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 17:34:58,556 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:58,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:58,557 INFO L85 PathProgramCache]: Analyzing trace with hash 2020590272, now seen corresponding path program 1 times [2022-07-19 17:34:58,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:58,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145960699] [2022-07-19 17:34:58,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:58,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:58,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:34:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:58,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:34:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:58,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:34:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:58,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:34:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:58,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:34:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:34:58,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:58,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145960699] [2022-07-19 17:34:58,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145960699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:58,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:34:58,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 17:34:58,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649767809] [2022-07-19 17:34:58,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:58,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 17:34:58,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:58,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 17:34:58,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:34:58,627 INFO L87 Difference]: Start difference. First operand 1462 states and 1912 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-19 17:34:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:59,182 INFO L93 Difference]: Finished difference Result 4674 states and 6439 transitions. [2022-07-19 17:34:59,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 17:34:59,182 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 63 [2022-07-19 17:34:59,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:59,198 INFO L225 Difference]: With dead ends: 4674 [2022-07-19 17:34:59,198 INFO L226 Difference]: Without dead ends: 3290 [2022-07-19 17:34:59,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:34:59,203 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 583 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:59,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 933 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 17:34:59,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3290 states. [2022-07-19 17:34:59,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3290 to 2074. [2022-07-19 17:34:59,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 1715 states have (on average 1.2979591836734694) internal successors, (2226), 1718 states have internal predecessors, (2226), 223 states have call successors, (223), 136 states have call predecessors, (223), 135 states have return successors, (262), 220 states have call predecessors, (262), 220 states have call successors, (262) [2022-07-19 17:34:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 2711 transitions. [2022-07-19 17:34:59,375 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 2711 transitions. Word has length 63 [2022-07-19 17:34:59,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:59,375 INFO L495 AbstractCegarLoop]: Abstraction has 2074 states and 2711 transitions. [2022-07-19 17:34:59,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-19 17:34:59,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 2711 transitions. [2022-07-19 17:34:59,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-19 17:34:59,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:59,376 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:34:59,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 17:34:59,377 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:59,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:59,377 INFO L85 PathProgramCache]: Analyzing trace with hash -285621863, now seen corresponding path program 1 times [2022-07-19 17:34:59,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:59,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860213382] [2022-07-19 17:34:59,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:59,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:59,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:34:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:59,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:34:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:59,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:34:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:59,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:34:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:59,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:34:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:59,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:34:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 17:34:59,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:59,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860213382] [2022-07-19 17:34:59,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860213382] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:34:59,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332362490] [2022-07-19 17:34:59,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:59,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:34:59,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:34:59,439 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-07-19 17:34:59,467 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-07-19 17:34:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:59,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 17:34:59,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:34:59,563 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:34:59,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:34:59,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332362490] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:59,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:34:59,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-07-19 17:34:59,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967769898] [2022-07-19 17:34:59,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:59,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:34:59,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:59,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:34:59,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:34:59,565 INFO L87 Difference]: Start difference. First operand 2074 states and 2711 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 17:34:59,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:59,815 INFO L93 Difference]: Finished difference Result 5786 states and 7696 transitions. [2022-07-19 17:34:59,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:34:59,816 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), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2022-07-19 17:34:59,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:59,835 INFO L225 Difference]: With dead ends: 5786 [2022-07-19 17:34:59,835 INFO L226 Difference]: Without dead ends: 3723 [2022-07-19 17:34:59,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 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-07-19 17:34:59,843 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 92 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:59,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 364 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:34:59,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2022-07-19 17:35:00,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3585. [2022-07-19 17:35:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3585 states, 2937 states have (on average 1.275110657133129) internal successors, (3745), 2941 states have internal predecessors, (3745), 402 states have call successors, (402), 246 states have call predecessors, (402), 245 states have return successors, (553), 399 states have call predecessors, (553), 399 states have call successors, (553) [2022-07-19 17:35:00,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 3585 states and 4700 transitions. [2022-07-19 17:35:00,129 INFO L78 Accepts]: Start accepts. Automaton has 3585 states and 4700 transitions. Word has length 68 [2022-07-19 17:35:00,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:00,130 INFO L495 AbstractCegarLoop]: Abstraction has 3585 states and 4700 transitions. [2022-07-19 17:35:00,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 17:35:00,131 INFO L276 IsEmpty]: Start isEmpty. Operand 3585 states and 4700 transitions. [2022-07-19 17:35:00,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-19 17:35:00,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:00,133 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:00,161 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-07-19 17:35:00,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:00,348 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:00,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:00,348 INFO L85 PathProgramCache]: Analyzing trace with hash -914471196, now seen corresponding path program 1 times [2022-07-19 17:35:00,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:00,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746886368] [2022-07-19 17:35:00,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:00,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:00,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:00,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:35:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:00,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:35:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:00,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:35:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:00,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:35:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:00,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:35:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 17:35:00,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:00,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746886368] [2022-07-19 17:35:00,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746886368] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:00,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:35:00,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 17:35:00,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139068861] [2022-07-19 17:35:00,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:00,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:35:00,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:00,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:35:00,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:35:00,404 INFO L87 Difference]: Start difference. First operand 3585 states and 4700 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 17:35:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:00,794 INFO L93 Difference]: Finished difference Result 7440 states and 9799 transitions. [2022-07-19 17:35:00,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 17:35:00,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 71 [2022-07-19 17:35:00,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:00,814 INFO L225 Difference]: With dead ends: 7440 [2022-07-19 17:35:00,814 INFO L226 Difference]: Without dead ends: 3870 [2022-07-19 17:35:00,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:35:00,825 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 163 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:00,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 435 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:35:00,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3870 states. [2022-07-19 17:35:01,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3870 to 3623. [2022-07-19 17:35:01,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3623 states, 2956 states have (on average 1.257104194857916) internal successors, (3716), 2979 states have internal predecessors, (3716), 402 states have call successors, (402), 246 states have call predecessors, (402), 264 states have return successors, (553), 399 states have call predecessors, (553), 399 states have call successors, (553) [2022-07-19 17:35:01,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 4671 transitions. [2022-07-19 17:35:01,117 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 4671 transitions. Word has length 71 [2022-07-19 17:35:01,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:01,117 INFO L495 AbstractCegarLoop]: Abstraction has 3623 states and 4671 transitions. [2022-07-19 17:35:01,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 17:35:01,118 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 4671 transitions. [2022-07-19 17:35:01,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-19 17:35:01,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:01,121 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:01,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 17:35:01,122 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:01,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:01,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1331867802, now seen corresponding path program 1 times [2022-07-19 17:35:01,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:01,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132859597] [2022-07-19 17:35:01,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:01,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:35:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:35:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:35:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:35:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:35:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,156 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 17:35:01,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:01,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132859597] [2022-07-19 17:35:01,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132859597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:01,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:35:01,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:35:01,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441911939] [2022-07-19 17:35:01,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:01,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:35:01,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:01,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:35:01,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:35:01,159 INFO L87 Difference]: Start difference. First operand 3623 states and 4671 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:35:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:01,440 INFO L93 Difference]: Finished difference Result 4090 states and 5308 transitions. [2022-07-19 17:35:01,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 17:35:01,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2022-07-19 17:35:01,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:01,456 INFO L225 Difference]: With dead ends: 4090 [2022-07-19 17:35:01,457 INFO L226 Difference]: Without dead ends: 3885 [2022-07-19 17:35:01,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:35:01,460 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 174 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:01,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 215 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:35:01,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3885 states. [2022-07-19 17:35:01,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3885 to 3554. [2022-07-19 17:35:01,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3554 states, 2903 states have (on average 1.258008956252153) internal successors, (3652), 2925 states have internal predecessors, (3652), 391 states have call successors, (391), 241 states have call predecessors, (391), 259 states have return successors, (542), 388 states have call predecessors, (542), 388 states have call successors, (542) [2022-07-19 17:35:01,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3554 states to 3554 states and 4585 transitions. [2022-07-19 17:35:01,780 INFO L78 Accepts]: Start accepts. Automaton has 3554 states and 4585 transitions. Word has length 71 [2022-07-19 17:35:01,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:01,781 INFO L495 AbstractCegarLoop]: Abstraction has 3554 states and 4585 transitions. [2022-07-19 17:35:01,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:35:01,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3554 states and 4585 transitions. [2022-07-19 17:35:01,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 17:35:01,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:01,782 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:01,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 17:35:01,783 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:01,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:01,783 INFO L85 PathProgramCache]: Analyzing trace with hash -2052507104, now seen corresponding path program 1 times [2022-07-19 17:35:01,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:01,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795002808] [2022-07-19 17:35:01,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:01,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:35:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:35:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:35:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:35:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 17:35:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:01,843 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 17:35:01,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:01,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795002808] [2022-07-19 17:35:01,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795002808] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:01,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:35:01,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 17:35:01,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524095239] [2022-07-19 17:35:01,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:01,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 17:35:01,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:01,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 17:35:01,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:35:01,846 INFO L87 Difference]: Start difference. First operand 3554 states and 4585 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 17:35:02,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:02,569 INFO L93 Difference]: Finished difference Result 10646 states and 14120 transitions. [2022-07-19 17:35:02,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 17:35:02,569 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 72 [2022-07-19 17:35:02,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:02,608 INFO L225 Difference]: With dead ends: 10646 [2022-07-19 17:35:02,608 INFO L226 Difference]: Without dead ends: 6920 [2022-07-19 17:35:02,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-19 17:35:02,621 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 634 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:02,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 770 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 17:35:02,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6920 states. [2022-07-19 17:35:03,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6920 to 6782. [2022-07-19 17:35:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6782 states, 5504 states have (on average 1.2185683139534884) internal successors, (6707), 5566 states have internal predecessors, (6707), 754 states have call successors, (754), 466 states have call predecessors, (754), 523 states have return successors, (1151), 751 states have call predecessors, (1151), 751 states have call successors, (1151) [2022-07-19 17:35:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6782 states to 6782 states and 8612 transitions. [2022-07-19 17:35:03,133 INFO L78 Accepts]: Start accepts. Automaton has 6782 states and 8612 transitions. Word has length 72 [2022-07-19 17:35:03,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:03,133 INFO L495 AbstractCegarLoop]: Abstraction has 6782 states and 8612 transitions. [2022-07-19 17:35:03,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 17:35:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 6782 states and 8612 transitions. [2022-07-19 17:35:03,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-19 17:35:03,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:03,143 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:03,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 17:35:03,143 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:03,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:03,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1221595769, now seen corresponding path program 1 times [2022-07-19 17:35:03,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:03,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122119529] [2022-07-19 17:35:03,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:03,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:35:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:35:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:35:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:35:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 17:35:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 17:35:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 17:35:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:35:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 17:35:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 17:35:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-19 17:35:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 17:35:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,237 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-19 17:35:03,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:03,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122119529] [2022-07-19 17:35:03,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122119529] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:03,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036096170] [2022-07-19 17:35:03,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:03,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:03,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:03,244 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-07-19 17:35:03,246 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-07-19 17:35:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:03,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 17:35:03,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:03,438 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-19 17:35:03,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:03,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036096170] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:03,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:03,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-07-19 17:35:03,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764798603] [2022-07-19 17:35:03,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:03,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:35:03,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:03,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:35:03,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:35:03,441 INFO L87 Difference]: Start difference. First operand 6782 states and 8612 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-19 17:35:03,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:03,826 INFO L93 Difference]: Finished difference Result 11268 states and 14376 transitions. [2022-07-19 17:35:03,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:35:03,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 127 [2022-07-19 17:35:03,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:03,844 INFO L225 Difference]: With dead ends: 11268 [2022-07-19 17:35:03,844 INFO L226 Difference]: Without dead ends: 4297 [2022-07-19 17:35:03,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:35:03,864 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 135 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-07-19 17:35:03,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 135 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:35:03,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4297 states. [2022-07-19 17:35:04,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4297 to 4293. [2022-07-19 17:35:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4293 states, 3485 states have (on average 1.20545193687231) internal successors, (4201), 3521 states have internal predecessors, (4201), 478 states have call successors, (478), 296 states have call predecessors, (478), 329 states have return successors, (694), 476 states have call predecessors, (694), 476 states have call successors, (694) [2022-07-19 17:35:04,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4293 states to 4293 states and 5373 transitions. [2022-07-19 17:35:04,211 INFO L78 Accepts]: Start accepts. Automaton has 4293 states and 5373 transitions. Word has length 127 [2022-07-19 17:35:04,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:04,211 INFO L495 AbstractCegarLoop]: Abstraction has 4293 states and 5373 transitions. [2022-07-19 17:35:04,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-19 17:35:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 4293 states and 5373 transitions. [2022-07-19 17:35:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-19 17:35:04,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:04,216 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:04,243 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-07-19 17:35:04,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-19 17:35:04,432 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:04,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:04,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1343258013, now seen corresponding path program 1 times [2022-07-19 17:35:04,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:04,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430219885] [2022-07-19 17:35:04,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:04,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:04,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:04,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:35:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:04,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:35:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:04,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:35:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:04,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:35:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:04,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 17:35:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:04,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:35:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:04,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:35:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:04,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 17:35:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:04,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 17:35:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:04,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 17:35:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:04,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 17:35:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:04,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 17:35:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:04,510 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-19 17:35:04,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:04,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430219885] [2022-07-19 17:35:04,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430219885] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:04,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298433170] [2022-07-19 17:35:04,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:04,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:04,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:04,512 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-07-19 17:35:04,514 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-07-19 17:35:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:04,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 17:35:04,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:04,702 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-19 17:35:04,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:04,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298433170] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:04,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:04,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-07-19 17:35:04,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326891528] [2022-07-19 17:35:04,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:04,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:35:04,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:04,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:35:04,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:35:04,705 INFO L87 Difference]: Start difference. First operand 4293 states and 5373 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-19 17:35:05,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:05,031 INFO L93 Difference]: Finished difference Result 9150 states and 11419 transitions. [2022-07-19 17:35:05,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:35:05,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 131 [2022-07-19 17:35:05,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:05,049 INFO L225 Difference]: With dead ends: 9150 [2022-07-19 17:35:05,049 INFO L226 Difference]: Without dead ends: 5190 [2022-07-19 17:35:05,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:35:05,061 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 45 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:05,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 266 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:35:05,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2022-07-19 17:35:05,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 5190. [2022-07-19 17:35:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5190 states, 4198 states have (on average 1.193425440686041) internal successors, (5010), 4238 states have internal predecessors, (5010), 583 states have call successors, (583), 371 states have call predecessors, (583), 408 states have return successors, (809), 581 states have call predecessors, (809), 581 states have call successors, (809) [2022-07-19 17:35:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 6402 transitions. [2022-07-19 17:35:05,380 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 6402 transitions. Word has length 131 [2022-07-19 17:35:05,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:05,381 INFO L495 AbstractCegarLoop]: Abstraction has 5190 states and 6402 transitions. [2022-07-19 17:35:05,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-19 17:35:05,381 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 6402 transitions. [2022-07-19 17:35:05,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-19 17:35:05,386 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:05,386 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:05,414 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-07-19 17:35:05,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:05,608 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:05,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:05,608 INFO L85 PathProgramCache]: Analyzing trace with hash 844943966, now seen corresponding path program 1 times [2022-07-19 17:35:05,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:05,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412470273] [2022-07-19 17:35:05,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:05,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:35:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:35:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:35:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:35:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 17:35:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:35:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:35:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 17:35:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 17:35:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 17:35:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 17:35:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 17:35:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-19 17:35:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,686 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-19 17:35:05,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:05,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412470273] [2022-07-19 17:35:05,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412470273] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:05,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443896296] [2022-07-19 17:35:05,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:05,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:05,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:05,689 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-07-19 17:35:05,690 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-07-19 17:35:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:05,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 17:35:05,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:05,813 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-19 17:35:05,813 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:05,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443896296] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:05,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:05,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-07-19 17:35:05,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284103430] [2022-07-19 17:35:05,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:05,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:35:05,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:05,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:35:05,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:35:05,816 INFO L87 Difference]: Start difference. First operand 5190 states and 6402 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-19 17:35:06,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:06,270 INFO L93 Difference]: Finished difference Result 13673 states and 17010 transitions. [2022-07-19 17:35:06,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:35:06,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 154 [2022-07-19 17:35:06,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:06,302 INFO L225 Difference]: With dead ends: 13673 [2022-07-19 17:35:06,302 INFO L226 Difference]: Without dead ends: 8722 [2022-07-19 17:35:06,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:35:06,319 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 95 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:06,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 356 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:35:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8722 states. [2022-07-19 17:35:06,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8722 to 8718. [2022-07-19 17:35:06,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8718 states, 7074 states have (on average 1.1707661860333616) internal successors, (8282), 7130 states have internal predecessors, (8282), 947 states have call successors, (947), 643 states have call predecessors, (947), 696 states have return successors, (1365), 945 states have call predecessors, (1365), 945 states have call successors, (1365) [2022-07-19 17:35:06,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8718 states to 8718 states and 10594 transitions. [2022-07-19 17:35:06,854 INFO L78 Accepts]: Start accepts. Automaton has 8718 states and 10594 transitions. Word has length 154 [2022-07-19 17:35:06,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:06,855 INFO L495 AbstractCegarLoop]: Abstraction has 8718 states and 10594 transitions. [2022-07-19 17:35:06,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-19 17:35:06,855 INFO L276 IsEmpty]: Start isEmpty. Operand 8718 states and 10594 transitions. [2022-07-19 17:35:06,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-19 17:35:06,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:06,861 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:06,889 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-07-19 17:35:07,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-19 17:35:07,075 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:07,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:07,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1688949468, now seen corresponding path program 1 times [2022-07-19 17:35:07,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:07,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33050588] [2022-07-19 17:35:07,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:07,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:35:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:35:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:35:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:35:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 17:35:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:35:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:35:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 17:35:07,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 17:35:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 17:35:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 17:35:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 17:35:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-19 17:35:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-19 17:35:07,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:07,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33050588] [2022-07-19 17:35:07,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33050588] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:07,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501977767] [2022-07-19 17:35:07,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:07,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:07,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:07,154 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-07-19 17:35:07,156 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-07-19 17:35:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:07,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 17:35:07,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:07,282 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 17:35:07,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:07,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501977767] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:07,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:07,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2022-07-19 17:35:07,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130580738] [2022-07-19 17:35:07,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:07,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 17:35:07,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:07,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 17:35:07,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-19 17:35:07,284 INFO L87 Difference]: Start difference. First operand 8718 states and 10594 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-19 17:35:07,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:07,602 INFO L93 Difference]: Finished difference Result 14114 states and 17190 transitions. [2022-07-19 17:35:07,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 17:35:07,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 154 [2022-07-19 17:35:07,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:07,621 INFO L225 Difference]: With dead ends: 14114 [2022-07-19 17:35:07,621 INFO L226 Difference]: Without dead ends: 5407 [2022-07-19 17:35:07,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-19 17:35:07,642 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 46 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:07,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 617 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:35:07,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5407 states. [2022-07-19 17:35:07,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5407 to 5115. [2022-07-19 17:35:07,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5115 states, 4342 states have (on average 1.1706586826347305) internal successors, (5083), 4354 states have internal predecessors, (5083), 440 states have call successors, (440), 276 states have call predecessors, (440), 332 states have return successors, (645), 484 states have call predecessors, (645), 438 states have call successors, (645) [2022-07-19 17:35:07,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5115 states to 5115 states and 6168 transitions. [2022-07-19 17:35:07,948 INFO L78 Accepts]: Start accepts. Automaton has 5115 states and 6168 transitions. Word has length 154 [2022-07-19 17:35:07,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:07,949 INFO L495 AbstractCegarLoop]: Abstraction has 5115 states and 6168 transitions. [2022-07-19 17:35:07,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-19 17:35:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 5115 states and 6168 transitions. [2022-07-19 17:35:07,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-19 17:35:07,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:07,954 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:07,982 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-07-19 17:35:08,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-19 17:35:08,179 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:08,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:08,180 INFO L85 PathProgramCache]: Analyzing trace with hash -493377335, now seen corresponding path program 1 times [2022-07-19 17:35:08,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:08,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453071903] [2022-07-19 17:35:08,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:08,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:08,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:08,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:35:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:08,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:35:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:08,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:35:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:08,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:35:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:08,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-19 17:35:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:08,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:35:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:08,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 17:35:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:08,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 17:35:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:08,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 17:35:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:08,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-19 17:35:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:08,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:35:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:08,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 17:35:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:08,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-19 17:35:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:08,301 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-19 17:35:08,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:08,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453071903] [2022-07-19 17:35:08,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453071903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:08,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:35:08,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:35:08,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151015281] [2022-07-19 17:35:08,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:08,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:35:08,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:08,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:35:08,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:35:08,303 INFO L87 Difference]: Start difference. First operand 5115 states and 6168 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-19 17:35:08,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:08,677 INFO L93 Difference]: Finished difference Result 5302 states and 6385 transitions. [2022-07-19 17:35:08,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 17:35:08,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 158 [2022-07-19 17:35:08,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:08,693 INFO L225 Difference]: With dead ends: 5302 [2022-07-19 17:35:08,693 INFO L226 Difference]: Without dead ends: 5025 [2022-07-19 17:35:08,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:35:08,697 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 94 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:08,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 299 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:35:08,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2022-07-19 17:35:09,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 4841. [2022-07-19 17:35:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4841 states, 4110 states have (on average 1.1734793187347932) internal successors, (4823), 4121 states have internal predecessors, (4823), 417 states have call successors, (417), 260 states have call predecessors, (417), 313 states have return successors, (619), 459 states have call predecessors, (619), 415 states have call successors, (619) [2022-07-19 17:35:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4841 states to 4841 states and 5859 transitions. [2022-07-19 17:35:09,056 INFO L78 Accepts]: Start accepts. Automaton has 4841 states and 5859 transitions. Word has length 158 [2022-07-19 17:35:09,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:09,056 INFO L495 AbstractCegarLoop]: Abstraction has 4841 states and 5859 transitions. [2022-07-19 17:35:09,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-19 17:35:09,057 INFO L276 IsEmpty]: Start isEmpty. Operand 4841 states and 5859 transitions. [2022-07-19 17:35:09,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-19 17:35:09,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:09,061 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:09,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 17:35:09,061 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:09,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:09,062 INFO L85 PathProgramCache]: Analyzing trace with hash -850407883, now seen corresponding path program 1 times [2022-07-19 17:35:09,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:09,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705128210] [2022-07-19 17:35:09,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:09,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:35:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:35:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:35:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:35:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:35:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 17:35:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 17:35:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 17:35:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 17:35:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 17:35:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 17:35:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-19 17:35:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-19 17:35:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,160 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 16 proven. 28 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-19 17:35:09,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:09,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705128210] [2022-07-19 17:35:09,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705128210] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:09,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275068537] [2022-07-19 17:35:09,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:09,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:09,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:09,164 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-07-19 17:35:09,179 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-07-19 17:35:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:09,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 17:35:09,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:09,383 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-19 17:35:09,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:09,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275068537] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:09,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:09,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-07-19 17:35:09,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324209625] [2022-07-19 17:35:09,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:09,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:35:09,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:09,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:35:09,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:35:09,387 INFO L87 Difference]: Start difference. First operand 4841 states and 5859 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-19 17:35:09,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:09,658 INFO L93 Difference]: Finished difference Result 9087 states and 11040 transitions. [2022-07-19 17:35:09,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:35:09,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 164 [2022-07-19 17:35:09,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:09,672 INFO L225 Difference]: With dead ends: 9087 [2022-07-19 17:35:09,673 INFO L226 Difference]: Without dead ends: 4503 [2022-07-19 17:35:09,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:35:09,681 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 25 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:09,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 259 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:35:09,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4503 states. [2022-07-19 17:35:09,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4503 to 4503. [2022-07-19 17:35:09,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4503 states, 3841 states have (on average 1.1759958344181203) internal successors, (4517), 3852 states have internal predecessors, (4517), 377 states have call successors, (377), 234 states have call predecessors, (377), 284 states have return successors, (568), 416 states have call predecessors, (568), 375 states have call successors, (568) [2022-07-19 17:35:09,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 5462 transitions. [2022-07-19 17:35:09,897 INFO L78 Accepts]: Start accepts. Automaton has 4503 states and 5462 transitions. Word has length 164 [2022-07-19 17:35:09,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:09,898 INFO L495 AbstractCegarLoop]: Abstraction has 4503 states and 5462 transitions. [2022-07-19 17:35:09,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-19 17:35:09,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4503 states and 5462 transitions. [2022-07-19 17:35:09,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-19 17:35:09,901 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:09,901 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:09,928 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-07-19 17:35:10,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-19 17:35:10,117 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:10,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:10,117 INFO L85 PathProgramCache]: Analyzing trace with hash 990777910, now seen corresponding path program 1 times [2022-07-19 17:35:10,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:10,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856155570] [2022-07-19 17:35:10,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:10,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:10,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:10,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:35:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:10,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:35:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:10,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:35:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:10,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:35:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:10,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:35:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:10,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 17:35:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:10,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 17:35:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:10,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 17:35:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:10,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 17:35:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:10,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 17:35:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:10,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 17:35:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:10,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-19 17:35:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:10,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-19 17:35:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:10,182 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-19 17:35:10,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:10,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856155570] [2022-07-19 17:35:10,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856155570] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:10,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904013522] [2022-07-19 17:35:10,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:10,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:10,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:10,184 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-07-19 17:35:10,185 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-07-19 17:35:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:10,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 17:35:10,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:10,305 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-19 17:35:10,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:10,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904013522] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:10,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:10,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2022-07-19 17:35:10,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065174232] [2022-07-19 17:35:10,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:10,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:35:10,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:10,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:35:10,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:35:10,310 INFO L87 Difference]: Start difference. First operand 4503 states and 5462 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-19 17:35:10,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:10,559 INFO L93 Difference]: Finished difference Result 8682 states and 10665 transitions. [2022-07-19 17:35:10,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:35:10,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 164 [2022-07-19 17:35:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:10,572 INFO L225 Difference]: With dead ends: 8682 [2022-07-19 17:35:10,572 INFO L226 Difference]: Without dead ends: 4330 [2022-07-19 17:35:10,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:35:10,581 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 84 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:10,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 301 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:35:10,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2022-07-19 17:35:10,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 4327. [2022-07-19 17:35:10,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4327 states, 3665 states have (on average 1.1607094133697136) internal successors, (4254), 3676 states have internal predecessors, (4254), 377 states have call successors, (377), 234 states have call predecessors, (377), 284 states have return successors, (568), 416 states have call predecessors, (568), 375 states have call successors, (568) [2022-07-19 17:35:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4327 states to 4327 states and 5199 transitions. [2022-07-19 17:35:10,811 INFO L78 Accepts]: Start accepts. Automaton has 4327 states and 5199 transitions. Word has length 164 [2022-07-19 17:35:10,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:10,812 INFO L495 AbstractCegarLoop]: Abstraction has 4327 states and 5199 transitions. [2022-07-19 17:35:10,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-19 17:35:10,812 INFO L276 IsEmpty]: Start isEmpty. Operand 4327 states and 5199 transitions. [2022-07-19 17:35:10,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-19 17:35:10,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:10,815 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:10,843 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-07-19 17:35:11,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:11,032 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:11,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:11,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1614442849, now seen corresponding path program 1 times [2022-07-19 17:35:11,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:11,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389639273] [2022-07-19 17:35:11,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:11,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:35:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:35:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:35:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:35:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:35:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 17:35:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 17:35:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 17:35:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 17:35:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 17:35:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 17:35:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-19 17:35:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-19 17:35:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:11,123 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-07-19 17:35:11,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:11,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389639273] [2022-07-19 17:35:11,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389639273] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:11,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:35:11,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 17:35:11,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796980665] [2022-07-19 17:35:11,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:11,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 17:35:11,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:11,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 17:35:11,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:35:11,126 INFO L87 Difference]: Start difference. First operand 4327 states and 5199 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-19 17:35:11,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:11,876 INFO L93 Difference]: Finished difference Result 11283 states and 13998 transitions. [2022-07-19 17:35:11,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 17:35:11,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 165 [2022-07-19 17:35:11,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:11,902 INFO L225 Difference]: With dead ends: 11283 [2022-07-19 17:35:11,902 INFO L226 Difference]: Without dead ends: 6881 [2022-07-19 17:35:11,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-19 17:35:11,914 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 430 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:11,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 802 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 17:35:11,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6881 states. [2022-07-19 17:35:12,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6881 to 4783. [2022-07-19 17:35:12,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4783 states, 4052 states have (on average 1.1581934846989141) internal successors, (4693), 4067 states have internal predecessors, (4693), 415 states have call successors, (415), 257 states have call predecessors, (415), 315 states have return successors, (623), 458 states have call predecessors, (623), 413 states have call successors, (623) [2022-07-19 17:35:12,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4783 states to 4783 states and 5731 transitions. [2022-07-19 17:35:12,215 INFO L78 Accepts]: Start accepts. Automaton has 4783 states and 5731 transitions. Word has length 165 [2022-07-19 17:35:12,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:12,216 INFO L495 AbstractCegarLoop]: Abstraction has 4783 states and 5731 transitions. [2022-07-19 17:35:12,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-19 17:35:12,216 INFO L276 IsEmpty]: Start isEmpty. Operand 4783 states and 5731 transitions. [2022-07-19 17:35:12,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-19 17:35:12,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:12,219 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:12,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 17:35:12,219 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:12,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:12,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2040758312, now seen corresponding path program 1 times [2022-07-19 17:35:12,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:12,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814104966] [2022-07-19 17:35:12,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:12,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:35:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:35:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:35:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:35:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 17:35:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 17:35:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 17:35:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:35:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 17:35:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 17:35:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 17:35:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 17:35:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-19 17:35:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-19 17:35:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,283 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-19 17:35:12,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:12,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814104966] [2022-07-19 17:35:12,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814104966] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:12,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931255090] [2022-07-19 17:35:12,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:12,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:12,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:12,285 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-07-19 17:35:12,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-07-19 17:35:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:12,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 17:35:12,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:12,468 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 17:35:12,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:12,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931255090] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:12,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:12,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-07-19 17:35:12,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435928726] [2022-07-19 17:35:12,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:12,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:35:12,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:12,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:35:12,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:35:12,470 INFO L87 Difference]: Start difference. First operand 4783 states and 5731 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-19 17:35:12,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:12,719 INFO L93 Difference]: Finished difference Result 8862 states and 10649 transitions. [2022-07-19 17:35:12,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:35:12,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 170 [2022-07-19 17:35:12,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:12,729 INFO L225 Difference]: With dead ends: 8862 [2022-07-19 17:35:12,730 INFO L226 Difference]: Without dead ends: 4169 [2022-07-19 17:35:12,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:35:12,736 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 58 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:12,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 279 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:35:12,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4169 states. [2022-07-19 17:35:12,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4169 to 3893. [2022-07-19 17:35:12,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3893 states, 3313 states have (on average 1.15333534560821) internal successors, (3821), 3324 states have internal predecessors, (3821), 329 states have call successors, (329), 203 states have call predecessors, (329), 250 states have return successors, (444), 365 states have call predecessors, (444), 327 states have call successors, (444) [2022-07-19 17:35:12,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 4594 transitions. [2022-07-19 17:35:12,965 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 4594 transitions. Word has length 170 [2022-07-19 17:35:12,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:12,965 INFO L495 AbstractCegarLoop]: Abstraction has 3893 states and 4594 transitions. [2022-07-19 17:35:12,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-19 17:35:12,966 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 4594 transitions. [2022-07-19 17:35:12,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-19 17:35:12,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:12,968 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:12,995 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-07-19 17:35:13,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-19 17:35:13,183 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:13,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:13,184 INFO L85 PathProgramCache]: Analyzing trace with hash -606151675, now seen corresponding path program 1 times [2022-07-19 17:35:13,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:13,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053697596] [2022-07-19 17:35:13,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:13,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:13,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:13,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:35:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:13,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:35:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:13,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:35:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:13,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:35:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:13,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 17:35:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:13,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 17:35:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:13,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 17:35:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:13,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:35:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:13,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 17:35:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:13,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 17:35:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:13,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 17:35:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:13,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 17:35:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:13,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-19 17:35:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:13,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-19 17:35:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:13,242 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-07-19 17:35:13,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:13,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053697596] [2022-07-19 17:35:13,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053697596] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:13,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796365008] [2022-07-19 17:35:13,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:13,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:13,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:13,244 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-07-19 17:35:13,245 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-07-19 17:35:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:13,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 17:35:13,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:13,388 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 17:35:13,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:13,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796365008] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:13,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:13,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2022-07-19 17:35:13,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640238169] [2022-07-19 17:35:13,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:13,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:35:13,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:13,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:35:13,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:35:13,391 INFO L87 Difference]: Start difference. First operand 3893 states and 4594 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-19 17:35:13,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:13,567 INFO L93 Difference]: Finished difference Result 4506 states and 5322 transitions. [2022-07-19 17:35:13,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:35:13,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 170 [2022-07-19 17:35:13,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:13,578 INFO L225 Difference]: With dead ends: 4506 [2022-07-19 17:35:13,578 INFO L226 Difference]: Without dead ends: 3896 [2022-07-19 17:35:13,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:35:13,581 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 51 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:13,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 332 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:35:13,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2022-07-19 17:35:13,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 3893. [2022-07-19 17:35:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3893 states, 3313 states have (on average 1.1494114095985513) internal successors, (3808), 3324 states have internal predecessors, (3808), 329 states have call successors, (329), 203 states have call predecessors, (329), 250 states have return successors, (444), 365 states have call predecessors, (444), 327 states have call successors, (444) [2022-07-19 17:35:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 4581 transitions. [2022-07-19 17:35:13,811 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 4581 transitions. Word has length 170 [2022-07-19 17:35:13,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:13,812 INFO L495 AbstractCegarLoop]: Abstraction has 3893 states and 4581 transitions. [2022-07-19 17:35:13,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-19 17:35:13,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 4581 transitions. [2022-07-19 17:35:13,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-19 17:35:13,814 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:13,814 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:13,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 17:35:14,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:14,039 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:14,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:14,039 INFO L85 PathProgramCache]: Analyzing trace with hash -635607035, now seen corresponding path program 1 times [2022-07-19 17:35:14,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:14,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578775871] [2022-07-19 17:35:14,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:14,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:35:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:35:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:35:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:35:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 17:35:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 17:35:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 17:35:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:35:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 17:35:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:35:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 17:35:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 17:35:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-19 17:35:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-19 17:35:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,122 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-19 17:35:14,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:14,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578775871] [2022-07-19 17:35:14,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578775871] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:14,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637145872] [2022-07-19 17:35:14,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:14,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:14,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:14,124 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-07-19 17:35:14,131 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-07-19 17:35:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:14,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 17:35:14,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-19 17:35:14,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:35:14,804 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-19 17:35:14,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637145872] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:35:14,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:35:14,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-07-19 17:35:14,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282584035] [2022-07-19 17:35:14,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:35:14,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 17:35:14,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:14,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 17:35:14,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:35:14,806 INFO L87 Difference]: Start difference. First operand 3893 states and 4581 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 5 states have internal predecessors, (136), 3 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-19 17:35:15,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:15,457 INFO L93 Difference]: Finished difference Result 8406 states and 10203 transitions. [2022-07-19 17:35:15,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 17:35:15,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 5 states have internal predecessors, (136), 3 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2022-07-19 17:35:15,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:15,476 INFO L225 Difference]: With dead ends: 8406 [2022-07-19 17:35:15,476 INFO L226 Difference]: Without dead ends: 5794 [2022-07-19 17:35:15,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 370 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-19 17:35:15,482 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 250 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:15,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1108 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 17:35:15,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5794 states. [2022-07-19 17:35:15,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5794 to 4184. [2022-07-19 17:35:15,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4184 states, 3559 states have (on average 1.1469513908401237) internal successors, (4082), 3570 states have internal predecessors, (4082), 355 states have call successors, (355), 219 states have call predecessors, (355), 269 states have return successors, (474), 394 states have call predecessors, (474), 353 states have call successors, (474) [2022-07-19 17:35:15,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4184 states to 4184 states and 4911 transitions. [2022-07-19 17:35:15,764 INFO L78 Accepts]: Start accepts. Automaton has 4184 states and 4911 transitions. Word has length 172 [2022-07-19 17:35:15,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:15,764 INFO L495 AbstractCegarLoop]: Abstraction has 4184 states and 4911 transitions. [2022-07-19 17:35:15,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 5 states have internal predecessors, (136), 3 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-19 17:35:15,764 INFO L276 IsEmpty]: Start isEmpty. Operand 4184 states and 4911 transitions. [2022-07-19 17:35:15,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-07-19 17:35:15,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:15,772 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:15,797 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-07-19 17:35:15,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-19 17:35:15,997 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:15,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:15,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1410851743, now seen corresponding path program 1 times [2022-07-19 17:35:15,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:15,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195996559] [2022-07-19 17:35:15,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:15,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:35:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:35:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:35:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:35:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 17:35:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 17:35:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 17:35:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:35:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 17:35:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:35:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 17:35:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 17:35:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-19 17:35:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-19 17:35:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-19 17:35:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-19 17:35:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-19 17:35:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-19 17:35:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-19 17:35:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-19 17:35:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-19 17:35:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-07-19 17:35:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,101 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 113 proven. 30 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2022-07-19 17:35:16,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:16,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195996559] [2022-07-19 17:35:16,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195996559] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:16,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521926522] [2022-07-19 17:35:16,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:16,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:16,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:16,103 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-07-19 17:35:16,133 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-07-19 17:35:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:16,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 17:35:16,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:16,275 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-19 17:35:16,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:16,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521926522] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:16,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:16,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-07-19 17:35:16,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136046584] [2022-07-19 17:35:16,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:16,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:35:16,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:16,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:35:16,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:35:16,277 INFO L87 Difference]: Start difference. First operand 4184 states and 4911 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-19 17:35:16,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:16,594 INFO L93 Difference]: Finished difference Result 10503 states and 12364 transitions. [2022-07-19 17:35:16,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:35:16,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 252 [2022-07-19 17:35:16,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:16,612 INFO L225 Difference]: With dead ends: 10503 [2022-07-19 17:35:16,612 INFO L226 Difference]: Without dead ends: 6523 [2022-07-19 17:35:16,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:35:16,621 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 61 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:16,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 340 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:35:16,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6523 states. [2022-07-19 17:35:17,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6523 to 6406. [2022-07-19 17:35:17,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6406 states, 5441 states have (on average 1.139680205844514) internal successors, (6201), 5452 states have internal predecessors, (6201), 561 states have call successors, (561), 346 states have call predecessors, (561), 403 states have return successors, (711), 607 states have call predecessors, (711), 559 states have call successors, (711) [2022-07-19 17:35:17,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6406 states to 6406 states and 7473 transitions. [2022-07-19 17:35:17,117 INFO L78 Accepts]: Start accepts. Automaton has 6406 states and 7473 transitions. Word has length 252 [2022-07-19 17:35:17,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:17,118 INFO L495 AbstractCegarLoop]: Abstraction has 6406 states and 7473 transitions. [2022-07-19 17:35:17,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-19 17:35:17,118 INFO L276 IsEmpty]: Start isEmpty. Operand 6406 states and 7473 transitions. [2022-07-19 17:35:17,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-07-19 17:35:17,126 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:17,126 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:17,152 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-07-19 17:35:17,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-19 17:35:17,339 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:17,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:17,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1078208605, now seen corresponding path program 1 times [2022-07-19 17:35:17,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:17,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167550231] [2022-07-19 17:35:17,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:17,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:35:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:35:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:35:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:35:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:35:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 17:35:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 17:35:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 17:35:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:35:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 17:35:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:35:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 17:35:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 17:35:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-19 17:35:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-19 17:35:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-19 17:35:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-19 17:35:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-19 17:35:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-19 17:35:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-19 17:35:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-19 17:35:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-19 17:35:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-07-19 17:35:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,425 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 94 proven. 13 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2022-07-19 17:35:17,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:17,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167550231] [2022-07-19 17:35:17,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167550231] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:17,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059010123] [2022-07-19 17:35:17,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:17,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:17,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:17,428 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-07-19 17:35:17,429 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-07-19 17:35:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:17,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 17:35:17,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:17,575 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-07-19 17:35:17,576 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:35:17,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059010123] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:35:17,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:35:17,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-07-19 17:35:17,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695513340] [2022-07-19 17:35:17,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:35:17,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:35:17,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:17,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:35:17,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:35:17,578 INFO L87 Difference]: Start difference. First operand 6406 states and 7473 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-19 17:35:17,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:17,759 INFO L93 Difference]: Finished difference Result 8806 states and 10273 transitions. [2022-07-19 17:35:17,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:35:17,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 252 [2022-07-19 17:35:17,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:17,767 INFO L225 Difference]: With dead ends: 8806 [2022-07-19 17:35:17,767 INFO L226 Difference]: Without dead ends: 2546 [2022-07-19 17:35:17,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 298 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:35:17,777 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 7 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:17,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 270 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:35:17,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2022-07-19 17:35:17,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2546. [2022-07-19 17:35:17,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2145 states have (on average 1.116083916083916) internal successors, (2394), 2158 states have internal predecessors, (2394), 220 states have call successors, (220), 149 states have call predecessors, (220), 180 states have return successors, (280), 238 states have call predecessors, (280), 218 states have call successors, (280) [2022-07-19 17:35:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 2894 transitions. [2022-07-19 17:35:17,911 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 2894 transitions. Word has length 252 [2022-07-19 17:35:17,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:17,912 INFO L495 AbstractCegarLoop]: Abstraction has 2546 states and 2894 transitions. [2022-07-19 17:35:17,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-19 17:35:17,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 2894 transitions. [2022-07-19 17:35:17,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2022-07-19 17:35:17,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:17,915 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:17,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-19 17:35:18,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-19 17:35:18,144 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:18,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:18,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1480841608, now seen corresponding path program 1 times [2022-07-19 17:35:18,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:18,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489490875] [2022-07-19 17:35:18,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:18,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 17:35:18,168 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 17:35:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 17:35:18,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 17:35:18,269 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 17:35:18,270 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 17:35:18,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-19 17:35:18,275 INFO L356 BasicCegarLoop]: Path program 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] [2022-07-19 17:35:18,280 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 17:35:18,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 05:35:18 BoogieIcfgContainer [2022-07-19 17:35:18,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 17:35:18,429 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 17:35:18,429 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 17:35:18,430 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 17:35:18,430 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:34:54" (3/4) ... [2022-07-19 17:35:18,432 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 17:35:18,560 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 17:35:18,561 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 17:35:18,561 INFO L158 Benchmark]: Toolchain (without parser) took 24563.35ms. Allocated memory was 96.5MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 56.1MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 536.5MB. Max. memory is 16.1GB. [2022-07-19 17:35:18,561 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory was 72.8MB in the beginning and 72.8MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 17:35:18,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.90ms. Allocated memory is still 96.5MB. Free memory was 55.9MB in the beginning and 69.9MB in the end (delta: -14.1MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2022-07-19 17:35:18,562 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.31ms. Allocated memory is still 96.5MB. Free memory was 69.9MB in the beginning and 67.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 17:35:18,562 INFO L158 Benchmark]: Boogie Preprocessor took 28.43ms. Allocated memory is still 96.5MB. Free memory was 67.8MB in the beginning and 66.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 17:35:18,562 INFO L158 Benchmark]: RCFGBuilder took 409.98ms. Allocated memory is still 96.5MB. Free memory was 66.1MB in the beginning and 50.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-19 17:35:18,563 INFO L158 Benchmark]: TraceAbstraction took 23652.32ms. Allocated memory was 96.5MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 49.9MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 507.0MB. Max. memory is 16.1GB. [2022-07-19 17:35:18,565 INFO L158 Benchmark]: Witness Printer took 131.51ms. Allocated memory is still 1.9GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-19 17:35:18,573 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.20ms. Allocated memory is still 96.5MB. Free memory was 72.8MB in the beginning and 72.8MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.90ms. Allocated memory is still 96.5MB. Free memory was 55.9MB in the beginning and 69.9MB in the end (delta: -14.1MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.31ms. Allocated memory is still 96.5MB. Free memory was 69.9MB in the beginning and 67.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.43ms. Allocated memory is still 96.5MB. Free memory was 67.8MB in the beginning and 66.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 409.98ms. Allocated memory is still 96.5MB. Free memory was 66.1MB in the beginning and 50.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23652.32ms. Allocated memory was 96.5MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 49.9MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 507.0MB. Max. memory is 16.1GB. * Witness Printer took 131.51ms. Allocated memory is still 1.9GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int max_loop ; [L26] int num ; [L27] int i ; [L28] int e ; [L29] int timer ; [L30] char data_0 ; [L31] char data_1 ; [L74] int P_1_pc; [L75] int P_1_st ; [L76] int P_1_i ; [L77] int P_1_ev ; [L132] int C_1_pc ; [L133] int C_1_st ; [L134] int C_1_i ; [L135] int C_1_ev ; [L136] int C_1_pr ; VAL [C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=0, num=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, timer=0] [L500] int count ; [L501] int __retres2 ; [L505] num = 0 [L506] i = 0 [L507] max_loop = 2 [L509] timer = 0 [L510] P_1_pc = 0 [L511] C_1_pc = 0 [L513] count = 0 [L514] CALL init_model() [L493] P_1_i = 1 [L494] C_1_i = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L514] RET init_model() [L515] CALL start_simulation() [L431] int kernel_st ; [L432] int tmp ; [L433] int tmp___0 ; [L437] kernel_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L438] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L439] CALL init_threads() [L236] COND TRUE (int )P_1_i == 1 [L237] P_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L241] COND TRUE (int )C_1_i == 1 [L242] C_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L439] RET init_threads() [L440] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L441] CALL activate_threads() VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L117] COND FALSE !((int )P_1_pc == 1) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L127] __retres1 = 0 VAL [\old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L129] return (__retres1); VAL [\old(C_1_st)=0, \old(P_1_st)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0, tmp=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L199] COND FALSE !((int )C_1_pc == 1) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L219] __retres1 = 0 VAL [\old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L221] return (__retres1); VAL [\old(C_1_st)=0, \old(P_1_st)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0, tmp=0, tmp___1=0] [L441] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L442] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L445] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, exists_runnable_thread()=1, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0, tmp=0, tmp___2=1] [L304] COND TRUE (int )C_1_st == 0 [L306] tmp___1 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp___1) [L310] C_1_st = 1 [L311] CALL C_1() [L138] char c ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L141] COND TRUE (int )C_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L156] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L158] COND TRUE num == 0 [L159] timer = 1 [L160] i += 1 [L161] C_1_pc = 1 [L162] C_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L311] RET C_1() [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1, tmp=0, tmp___1=-1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1, tmp=0, tmp___1=-1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1, tmp=0, tmp___1=-1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND TRUE (int )P_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L96] CALL write_data(num, 'A') [L59] COND TRUE i___0 == 0 [L60] data_0 = c VAL [\old(c)=65, \old(i___0)=0, c=65, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, i___0=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-2, tmp___1=-1, tmp___2=1] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-2, tmp___1=-1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [__retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L268] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, exists_runnable_thread()=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-2, tmp___1=-1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-2, tmp___1=-1, tmp___2=0] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=2, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L453] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=2, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L456] kernel_st = 3 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L457] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L458] CALL activate_threads() VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L127] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L129] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L219] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L221] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___1=0] [L458] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L459] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [__retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L268] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, exists_runnable_thread()=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L129] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L200] COND FALSE !((int )e == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L219] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L221] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1, tmp___1=0] [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 VAL [__retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L427] return (__retres2); VAL [\result=0, __retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L445] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [\old(c)=65, \old(i___0)=1, c=65, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, i___0=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L62] COND TRUE i___0 == 1 [L63] data_1 = c VAL [\old(c)=65, \old(i___0)=1, c=65, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, i___0=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-3, tmp___2=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-3, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [__retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L268] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, exists_runnable_thread()=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-3, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-3, tmp___2=0] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L453] FCALL update_channels() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L456] kernel_st = 3 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L457] FCALL fire_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L458] CALL activate_threads() VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L127] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L129] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L219] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L221] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___1=0] [L458] RET activate_threads() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L459] FCALL reset_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [__retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L268] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, exists_runnable_thread()=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L129] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L200] COND FALSE !((int )e == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L219] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L221] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1, tmp___1=0] [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 VAL [__retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L427] return (__retres2); VAL [\result=0, __retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L445] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [\old(c)=65, \old(i___0)=2, c=65, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L62] COND FALSE !(i___0 == 1) VAL [\old(c)=65, \old(i___0)=2, c=65, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L66] CALL error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L19] reach_error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.4s, OverallIterations: 26, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5227 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5075 mSDsluCounter, 12638 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7538 mSDsCounter, 798 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2839 IncrementalHoareTripleChecker+Invalid, 3637 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 798 mSolverCounterUnsat, 5100 mSDtfsCounter, 2839 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2880 GetRequests, 2717 SyntacticMatches, 6 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8718occurred in iteration=15, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 7837 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 5201 NumberOfCodeBlocks, 5201 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 5059 ConstructedInterpolants, 0 QuantifiedInterpolants, 9500 SizeOfPredicates, 4 NumberOfNonLiveVariables, 5501 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 38 InterpolantComputations, 24 PerfectInterpolantSequences, 4284/4568 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-19 17:35:18,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE