./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-packetengines-hamachi.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 173e3943 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/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-packetengines-hamachi.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 141cc550f279b59aa80e553b6a405c5654c50ab0a30e94ad7616006c63d0c81e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 19:02:47,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 19:02:47,103 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 19:02:47,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 19:02:47,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 19:02:47,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 19:02:47,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 19:02:47,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 19:02:47,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 19:02:47,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 19:02:47,166 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 19:02:47,167 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 19:02:47,167 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 19:02:47,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 19:02:47,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 19:02:47,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 19:02:47,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 19:02:47,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 19:02:47,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 19:02:47,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 19:02:47,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 19:02:47,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 19:02:47,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 19:02:47,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 19:02:47,193 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 19:02:47,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 19:02:47,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 19:02:47,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 19:02:47,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 19:02:47,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 19:02:47,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 19:02:47,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 19:02:47,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 19:02:47,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 19:02:47,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 19:02:47,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 19:02:47,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 19:02:47,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 19:02:47,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 19:02:47,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 19:02:47,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 19:02:47,207 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 19:02:47,227 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 19:02:47,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 19:02:47,231 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 19:02:47,231 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 19:02:47,233 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 19:02:47,233 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 19:02:47,233 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 19:02:47,233 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 19:02:47,233 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 19:02:47,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 19:02:47,234 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 19:02:47,234 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 19:02:47,234 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 19:02:47,235 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 19:02:47,235 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 19:02:47,235 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 19:02:47,235 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 19:02:47,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 19:02:47,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 19:02:47,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 19:02:47,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 19:02:47,236 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 19:02:47,236 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 19:02:47,236 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 19:02:47,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 19:02:47,237 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 19:02:47,237 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 19:02:47,237 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 19:02:47,237 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 19:02:47,237 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 141cc550f279b59aa80e553b6a405c5654c50ab0a30e94ad7616006c63d0c81e [2021-11-06 19:02:47,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 19:02:47,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 19:02:47,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 19:02:47,447 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 19:02:47,447 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 19:02:47,448 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-packetengines-hamachi.cil.i [2021-11-06 19:02:47,495 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac96241bc/af0092abb1464f6c90fefd57f71d276b/FLAG79f20f137 [2021-11-06 19:02:48,111 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 19:02:48,112 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-packetengines-hamachi.cil.i [2021-11-06 19:02:48,143 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac96241bc/af0092abb1464f6c90fefd57f71d276b/FLAG79f20f137 [2021-11-06 19:02:48,520 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac96241bc/af0092abb1464f6c90fefd57f71d276b [2021-11-06 19:02:48,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 19:02:48,523 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 19:02:48,524 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 19:02:48,524 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 19:02:48,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 19:02:48,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:02:48" (1/1) ... [2021-11-06 19:02:48,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64618ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:02:48, skipping insertion in model container [2021-11-06 19:02:48,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:02:48" (1/1) ... [2021-11-06 19:02:48,532 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 19:02:48,634 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 19:02:50,007 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-packetengines-hamachi.cil.i[322818,322831] [2021-11-06 19:02:50,010 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-packetengines-hamachi.cil.i[322987,323000] [2021-11-06 19:02:50,010 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-packetengines-hamachi.cil.i[323154,323167] [2021-11-06 19:02:50,011 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-packetengines-hamachi.cil.i[323322,323335] [2021-11-06 19:02:50,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 19:02:50,096 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 19:02:50,347 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-packetengines-hamachi.cil.i[322818,322831] [2021-11-06 19:02:50,348 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-packetengines-hamachi.cil.i[322987,323000] [2021-11-06 19:02:50,349 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-packetengines-hamachi.cil.i[323154,323167] [2021-11-06 19:02:50,349 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-packetengines-hamachi.cil.i[323322,323335] [2021-11-06 19:02:50,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 19:02:50,488 INFO L208 MainTranslator]: Completed translation [2021-11-06 19:02:50,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:02:50 WrapperNode [2021-11-06 19:02:50,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 19:02:50,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 19:02:50,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 19:02:50,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 19:02:50,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:02:50" (1/1) ... [2021-11-06 19:02:50,581 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:02:50" (1/1) ... [2021-11-06 19:02:50,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 19:02:50,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 19:02:50,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 19:02:50,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 19:02:50,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:02:50" (1/1) ... [2021-11-06 19:02:50,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:02:50" (1/1) ... [2021-11-06 19:02:50,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:02:50" (1/1) ... [2021-11-06 19:02:50,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:02:50" (1/1) ... [2021-11-06 19:02:51,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:02:50" (1/1) ... [2021-11-06 19:02:51,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:02:50" (1/1) ... [2021-11-06 19:02:51,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:02:50" (1/1) ... [2021-11-06 19:02:51,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 19:02:51,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 19:02:51,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 19:02:51,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 19:02:51,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:02:50" (1/1) ... [2021-11-06 19:02:51,283 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 19:02:51,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 19:02:51,304 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) [2021-11-06 19:02:51,333 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 [2021-11-06 19:02:51,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 19:02:51,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-06 19:02:51,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-06 19:02:51,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 19:02:51,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 19:02:51,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 19:02:51,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 19:02:51,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 19:02:51,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 19:02:51,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 19:02:51,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 19:02:51,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 19:02:51,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 19:02:51,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 19:02:51,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 19:02:56,543 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_1_switch_break#2: ldv_switch_1_#res := 0; [2021-11-06 19:02:56,543 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_1_switch_break#3: ldv_switch_1_#res := 0; [2021-11-06 19:02:56,544 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_2_switch_break#2: ldv_switch_2_#res := 0; [2021-11-06 19:02:56,544 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_2_switch_break#3: ldv_switch_2_#res := 0; [2021-11-06 19:02:56,544 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_2_switch_break#4: ldv_switch_2_#res := 0; [2021-11-06 19:02:56,544 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_1_switch_break: ldv_switch_1_#res := 0; [2021-11-06 19:02:56,544 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_0_switch_break#2: ldv_switch_0_#res := 0; [2021-11-06 19:02:56,544 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_2_switch_break: ldv_switch_2_#res := 0; [2021-11-06 19:02:56,544 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_0_switch_break: ldv_switch_0_#res := 0; [2021-11-06 19:02:56,544 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-06 19:02:56,560 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 19:02:56,561 INFO L299 CfgBuilder]: Removed 2716 assume(true) statements. [2021-11-06 19:02:56,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:02:56 BoogieIcfgContainer [2021-11-06 19:02:56,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 19:02:56,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 19:02:56,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 19:02:56,567 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 19:02:56,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:02:48" (1/3) ... [2021-11-06 19:02:56,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fa238d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:02:56, skipping insertion in model container [2021-11-06 19:02:56,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:02:50" (2/3) ... [2021-11-06 19:02:56,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fa238d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:02:56, skipping insertion in model container [2021-11-06 19:02:56,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:02:56" (3/3) ... [2021-11-06 19:02:56,569 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-packetengines-hamachi.cil.i [2021-11-06 19:02:56,572 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 19:02:56,573 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2021-11-06 19:02:56,608 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 19:02:56,611 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 19:02:56,612 INFO L340 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2021-11-06 19:02:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand has 2565 states, 2521 states have (on average 1.3351844506148354) internal successors, (3366), 2564 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:02:56,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-06 19:02:56,649 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 19:02:56,649 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 19:02:56,650 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 41 more)] === [2021-11-06 19:02:56,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 19:02:56,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1773586537, now seen corresponding path program 1 times [2021-11-06 19:02:56,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 19:02:56,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302636785] [2021-11-06 19:02:56,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 19:02:56,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 19:02:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 19:02:57,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 19:02:57,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 19:02:57,016 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302636785] [2021-11-06 19:02:57,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302636785] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 19:02:57,017 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 19:02:57,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 19:02:57,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434345038] [2021-11-06 19:02:57,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 19:02:57,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 19:02:57,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 19:02:57,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 19:02:57,039 INFO L87 Difference]: Start difference. First operand has 2565 states, 2521 states have (on average 1.3351844506148354) internal successors, (3366), 2564 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:02:58,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 19:02:58,043 INFO L93 Difference]: Finished difference Result 6970 states and 9147 transitions. [2021-11-06 19:02:58,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 19:02:58,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-11-06 19:02:58,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 19:02:58,070 INFO L225 Difference]: With dead ends: 6970 [2021-11-06 19:02:58,070 INFO L226 Difference]: Without dead ends: 4265 [2021-11-06 19:02:58,079 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 19:02:58,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4265 states. [2021-11-06 19:02:58,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4265 to 3923. [2021-11-06 19:02:58,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3923 states, 3879 states have (on average 1.2712039185357051) internal successors, (4931), 3922 states have internal predecessors, (4931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:02:58,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 4931 transitions. [2021-11-06 19:02:58,207 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 4931 transitions. Word has length 43 [2021-11-06 19:02:58,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 19:02:58,207 INFO L470 AbstractCegarLoop]: Abstraction has 3923 states and 4931 transitions. [2021-11-06 19:02:58,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:02:58,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 4931 transitions. [2021-11-06 19:02:58,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-06 19:02:58,212 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 19:02:58,212 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 19:02:58,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 19:02:58,213 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 41 more)] === [2021-11-06 19:02:58,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 19:02:58,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1588786041, now seen corresponding path program 1 times [2021-11-06 19:02:58,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 19:02:58,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841093012] [2021-11-06 19:02:58,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 19:02:58,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 19:02:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 19:02:58,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 19:02:58,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 19:02:58,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841093012] [2021-11-06 19:02:58,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841093012] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 19:02:58,308 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 19:02:58,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 19:02:58,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700728883] [2021-11-06 19:02:58,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 19:02:58,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 19:02:58,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 19:02:58,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 19:02:58,311 INFO L87 Difference]: Start difference. First operand 3923 states and 4931 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:02:59,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 19:02:59,201 INFO L93 Difference]: Finished difference Result 11371 states and 14374 transitions. [2021-11-06 19:02:59,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 19:02:59,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-06 19:02:59,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 19:02:59,221 INFO L225 Difference]: With dead ends: 11371 [2021-11-06 19:02:59,221 INFO L226 Difference]: Without dead ends: 7524 [2021-11-06 19:02:59,226 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 19:02:59,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7524 states. [2021-11-06 19:02:59,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7524 to 7508. [2021-11-06 19:02:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7508 states, 7464 states have (on average 1.2733118971061093) internal successors, (9504), 7507 states have internal predecessors, (9504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:02:59,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7508 states to 7508 states and 9504 transitions. [2021-11-06 19:02:59,351 INFO L78 Accepts]: Start accepts. Automaton has 7508 states and 9504 transitions. Word has length 45 [2021-11-06 19:02:59,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 19:02:59,351 INFO L470 AbstractCegarLoop]: Abstraction has 7508 states and 9504 transitions. [2021-11-06 19:02:59,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:02:59,352 INFO L276 IsEmpty]: Start isEmpty. Operand 7508 states and 9504 transitions. [2021-11-06 19:02:59,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-06 19:02:59,353 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 19:02:59,353 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 19:02:59,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 19:02:59,353 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 41 more)] === [2021-11-06 19:02:59,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 19:02:59,354 INFO L85 PathProgramCache]: Analyzing trace with hash 784747092, now seen corresponding path program 1 times [2021-11-06 19:02:59,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 19:02:59,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555770978] [2021-11-06 19:02:59,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 19:02:59,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 19:02:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 19:02:59,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 19:02:59,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 19:02:59,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555770978] [2021-11-06 19:02:59,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555770978] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 19:02:59,444 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 19:02:59,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 19:02:59,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518649357] [2021-11-06 19:02:59,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 19:02:59,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 19:02:59,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 19:02:59,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 19:02:59,446 INFO L87 Difference]: Start difference. First operand 7508 states and 9504 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:00,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 19:03:00,876 INFO L93 Difference]: Finished difference Result 20808 states and 26352 transitions. [2021-11-06 19:03:00,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 19:03:00,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-11-06 19:03:00,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 19:03:00,915 INFO L225 Difference]: With dead ends: 20808 [2021-11-06 19:03:00,916 INFO L226 Difference]: Without dead ends: 13376 [2021-11-06 19:03:00,930 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 19:03:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13376 states. [2021-11-06 19:03:01,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13376 to 12742. [2021-11-06 19:03:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12742 states, 12698 states have (on average 1.2745314222712238) internal successors, (16184), 12741 states have internal predecessors, (16184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:01,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12742 states to 12742 states and 16184 transitions. [2021-11-06 19:03:01,300 INFO L78 Accepts]: Start accepts. Automaton has 12742 states and 16184 transitions. Word has length 49 [2021-11-06 19:03:01,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 19:03:01,301 INFO L470 AbstractCegarLoop]: Abstraction has 12742 states and 16184 transitions. [2021-11-06 19:03:01,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:01,301 INFO L276 IsEmpty]: Start isEmpty. Operand 12742 states and 16184 transitions. [2021-11-06 19:03:01,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-06 19:03:01,303 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 19:03:01,303 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 19:03:01,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 19:03:01,304 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 41 more)] === [2021-11-06 19:03:01,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 19:03:01,304 INFO L85 PathProgramCache]: Analyzing trace with hash 627299292, now seen corresponding path program 1 times [2021-11-06 19:03:01,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 19:03:01,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716630825] [2021-11-06 19:03:01,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 19:03:01,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 19:03:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 19:03:01,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 19:03:01,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 19:03:01,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716630825] [2021-11-06 19:03:01,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716630825] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 19:03:01,427 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 19:03:01,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 19:03:01,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749648950] [2021-11-06 19:03:01,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 19:03:01,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 19:03:01,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 19:03:01,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 19:03:01,428 INFO L87 Difference]: Start difference. First operand 12742 states and 16184 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:03,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 19:03:03,336 INFO L93 Difference]: Finished difference Result 25416 states and 32307 transitions. [2021-11-06 19:03:03,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 19:03:03,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-11-06 19:03:03,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 19:03:03,375 INFO L225 Difference]: With dead ends: 25416 [2021-11-06 19:03:03,375 INFO L226 Difference]: Without dead ends: 18908 [2021-11-06 19:03:03,391 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 19:03:03,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18908 states. [2021-11-06 19:03:03,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18908 to 18892. [2021-11-06 19:03:03,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18892 states, 18848 states have (on average 1.2749363327674024) internal successors, (24030), 18891 states have internal predecessors, (24030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:03,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18892 states to 18892 states and 24030 transitions. [2021-11-06 19:03:03,868 INFO L78 Accepts]: Start accepts. Automaton has 18892 states and 24030 transitions. Word has length 76 [2021-11-06 19:03:03,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 19:03:03,869 INFO L470 AbstractCegarLoop]: Abstraction has 18892 states and 24030 transitions. [2021-11-06 19:03:03,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand 18892 states and 24030 transitions. [2021-11-06 19:03:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-06 19:03:03,872 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 19:03:03,872 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 19:03:03,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 19:03:03,872 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 41 more)] === [2021-11-06 19:03:03,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 19:03:03,873 INFO L85 PathProgramCache]: Analyzing trace with hash -652564386, now seen corresponding path program 1 times [2021-11-06 19:03:03,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 19:03:03,873 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522377486] [2021-11-06 19:03:03,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 19:03:03,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 19:03:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 19:03:03,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 19:03:03,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 19:03:03,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522377486] [2021-11-06 19:03:03,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522377486] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 19:03:03,960 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 19:03:03,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 19:03:03,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357775661] [2021-11-06 19:03:03,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 19:03:03,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 19:03:03,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 19:03:03,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 19:03:03,961 INFO L87 Difference]: Start difference. First operand 18892 states and 24030 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:05,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 19:03:05,183 INFO L93 Difference]: Finished difference Result 37720 states and 48007 transitions. [2021-11-06 19:03:05,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 19:03:05,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-11-06 19:03:05,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 19:03:05,239 INFO L225 Difference]: With dead ends: 37720 [2021-11-06 19:03:05,240 INFO L226 Difference]: Without dead ends: 25062 [2021-11-06 19:03:05,267 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 19:03:05,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25062 states. [2021-11-06 19:03:05,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25062 to 25019. [2021-11-06 19:03:05,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25019 states, 24975 states have (on average 1.2753953953953954) internal successors, (31853), 25018 states have internal predecessors, (31853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25019 states to 25019 states and 31853 transitions. [2021-11-06 19:03:05,829 INFO L78 Accepts]: Start accepts. Automaton has 25019 states and 31853 transitions. Word has length 76 [2021-11-06 19:03:05,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 19:03:05,831 INFO L470 AbstractCegarLoop]: Abstraction has 25019 states and 31853 transitions. [2021-11-06 19:03:05,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:05,832 INFO L276 IsEmpty]: Start isEmpty. Operand 25019 states and 31853 transitions. [2021-11-06 19:03:05,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-06 19:03:05,834 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 19:03:05,835 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 19:03:05,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 19:03:05,835 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 41 more)] === [2021-11-06 19:03:05,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 19:03:05,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1623681169, now seen corresponding path program 1 times [2021-11-06 19:03:05,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 19:03:05,840 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033266012] [2021-11-06 19:03:05,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 19:03:05,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 19:03:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 19:03:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-06 19:03:06,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 19:03:06,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033266012] [2021-11-06 19:03:06,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033266012] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 19:03:06,012 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 19:03:06,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 19:03:06,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178404799] [2021-11-06 19:03:06,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 19:03:06,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 19:03:06,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 19:03:06,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 19:03:06,014 INFO L87 Difference]: Start difference. First operand 25019 states and 31853 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:06,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 19:03:06,522 INFO L93 Difference]: Finished difference Result 25019 states and 31853 transitions. [2021-11-06 19:03:06,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 19:03:06,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-11-06 19:03:06,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 19:03:06,563 INFO L225 Difference]: With dead ends: 25019 [2021-11-06 19:03:06,564 INFO L226 Difference]: Without dead ends: 25013 [2021-11-06 19:03:06,570 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 19:03:06,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25013 states. [2021-11-06 19:03:06,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25013 to 25013. [2021-11-06 19:03:06,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25013 states, 24972 states have (on average 1.2753083453467884) internal successors, (31847), 25012 states have internal predecessors, (31847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:06,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25013 states to 25013 states and 31847 transitions. [2021-11-06 19:03:06,986 INFO L78 Accepts]: Start accepts. Automaton has 25013 states and 31847 transitions. Word has length 79 [2021-11-06 19:03:06,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 19:03:06,987 INFO L470 AbstractCegarLoop]: Abstraction has 25013 states and 31847 transitions. [2021-11-06 19:03:06,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:06,987 INFO L276 IsEmpty]: Start isEmpty. Operand 25013 states and 31847 transitions. [2021-11-06 19:03:06,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-06 19:03:06,990 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 19:03:06,990 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 19:03:06,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 19:03:06,991 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 41 more)] === [2021-11-06 19:03:06,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 19:03:06,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1200007807, now seen corresponding path program 1 times [2021-11-06 19:03:06,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 19:03:06,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103136115] [2021-11-06 19:03:06,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 19:03:06,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 19:03:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 19:03:07,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 19:03:07,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 19:03:07,109 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103136115] [2021-11-06 19:03:07,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103136115] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 19:03:07,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 19:03:07,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 19:03:07,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490700112] [2021-11-06 19:03:07,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 19:03:07,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 19:03:07,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 19:03:07,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 19:03:07,118 INFO L87 Difference]: Start difference. First operand 25013 states and 31847 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:08,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 19:03:08,672 INFO L93 Difference]: Finished difference Result 50249 states and 64244 transitions. [2021-11-06 19:03:08,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 19:03:08,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-11-06 19:03:08,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 19:03:08,718 INFO L225 Difference]: With dead ends: 50249 [2021-11-06 19:03:08,718 INFO L226 Difference]: Without dead ends: 25312 [2021-11-06 19:03:08,746 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 19:03:08,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25312 states. [2021-11-06 19:03:09,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25312 to 25211. [2021-11-06 19:03:09,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25211 states, 25170 states have (on average 1.2791021056813667) internal successors, (32195), 25210 states have internal predecessors, (32195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:09,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25211 states to 25211 states and 32195 transitions. [2021-11-06 19:03:09,163 INFO L78 Accepts]: Start accepts. Automaton has 25211 states and 32195 transitions. Word has length 79 [2021-11-06 19:03:09,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 19:03:09,164 INFO L470 AbstractCegarLoop]: Abstraction has 25211 states and 32195 transitions. [2021-11-06 19:03:09,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:09,164 INFO L276 IsEmpty]: Start isEmpty. Operand 25211 states and 32195 transitions. [2021-11-06 19:03:09,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-06 19:03:09,169 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 19:03:09,169 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 19:03:09,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 19:03:09,170 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 41 more)] === [2021-11-06 19:03:09,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 19:03:09,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1284326830, now seen corresponding path program 1 times [2021-11-06 19:03:09,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 19:03:09,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315531113] [2021-11-06 19:03:09,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 19:03:09,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 19:03:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 19:03:09,339 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-06 19:03:09,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 19:03:09,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315531113] [2021-11-06 19:03:09,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315531113] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 19:03:09,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 19:03:09,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 19:03:09,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387275351] [2021-11-06 19:03:09,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 19:03:09,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 19:03:09,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 19:03:09,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 19:03:09,342 INFO L87 Difference]: Start difference. First operand 25211 states and 32195 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:09,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 19:03:09,751 INFO L93 Difference]: Finished difference Result 25211 states and 32195 transitions. [2021-11-06 19:03:09,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 19:03:09,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-06 19:03:09,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 19:03:09,789 INFO L225 Difference]: With dead ends: 25211 [2021-11-06 19:03:09,789 INFO L226 Difference]: Without dead ends: 25205 [2021-11-06 19:03:09,796 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 19:03:09,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25205 states. [2021-11-06 19:03:10,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25205 to 25205. [2021-11-06 19:03:10,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25205 states, 25167 states have (on average 1.279016171971232) internal successors, (32189), 25204 states have internal predecessors, (32189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:10,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25205 states to 25205 states and 32189 transitions. [2021-11-06 19:03:10,232 INFO L78 Accepts]: Start accepts. Automaton has 25205 states and 32189 transitions. Word has length 81 [2021-11-06 19:03:10,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 19:03:10,233 INFO L470 AbstractCegarLoop]: Abstraction has 25205 states and 32189 transitions. [2021-11-06 19:03:10,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:10,233 INFO L276 IsEmpty]: Start isEmpty. Operand 25205 states and 32189 transitions. [2021-11-06 19:03:10,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-06 19:03:10,237 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 19:03:10,237 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 19:03:10,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 19:03:10,238 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 41 more)] === [2021-11-06 19:03:10,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 19:03:10,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1582321227, now seen corresponding path program 1 times [2021-11-06 19:03:10,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 19:03:10,239 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429260117] [2021-11-06 19:03:10,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 19:03:10,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 19:03:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 19:03:10,387 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-06 19:03:10,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 19:03:10,389 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429260117] [2021-11-06 19:03:10,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429260117] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 19:03:10,389 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 19:03:10,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 19:03:10,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796212001] [2021-11-06 19:03:10,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 19:03:10,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 19:03:10,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 19:03:10,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 19:03:10,391 INFO L87 Difference]: Start difference. First operand 25205 states and 32189 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:10,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 19:03:10,848 INFO L93 Difference]: Finished difference Result 25205 states and 32189 transitions. [2021-11-06 19:03:10,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 19:03:10,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-11-06 19:03:10,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 19:03:10,884 INFO L225 Difference]: With dead ends: 25205 [2021-11-06 19:03:10,884 INFO L226 Difference]: Without dead ends: 25199 [2021-11-06 19:03:10,893 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 19:03:10,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25199 states. [2021-11-06 19:03:11,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25199 to 25199. [2021-11-06 19:03:11,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25199 states, 25164 states have (on average 1.2789302177714195) internal successors, (32183), 25198 states have internal predecessors, (32183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25199 states to 25199 states and 32183 transitions. [2021-11-06 19:03:11,530 INFO L78 Accepts]: Start accepts. Automaton has 25199 states and 32183 transitions. Word has length 83 [2021-11-06 19:03:11,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 19:03:11,530 INFO L470 AbstractCegarLoop]: Abstraction has 25199 states and 32183 transitions. [2021-11-06 19:03:11,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:11,531 INFO L276 IsEmpty]: Start isEmpty. Operand 25199 states and 32183 transitions. [2021-11-06 19:03:11,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-06 19:03:11,537 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 19:03:11,537 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 19:03:11,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 19:03:11,537 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 41 more)] === [2021-11-06 19:03:11,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 19:03:11,538 INFO L85 PathProgramCache]: Analyzing trace with hash -192127592, now seen corresponding path program 1 times [2021-11-06 19:03:11,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 19:03:11,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644734552] [2021-11-06 19:03:11,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 19:03:11,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 19:03:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 19:03:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-06 19:03:11,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 19:03:11,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644734552] [2021-11-06 19:03:11,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644734552] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 19:03:11,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 19:03:11,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 19:03:11,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285947614] [2021-11-06 19:03:11,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 19:03:11,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 19:03:11,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 19:03:11,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 19:03:11,670 INFO L87 Difference]: Start difference. First operand 25199 states and 32183 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:12,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 19:03:12,119 INFO L93 Difference]: Finished difference Result 25199 states and 32183 transitions. [2021-11-06 19:03:12,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 19:03:12,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-11-06 19:03:12,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 19:03:12,157 INFO L225 Difference]: With dead ends: 25199 [2021-11-06 19:03:12,158 INFO L226 Difference]: Without dead ends: 25193 [2021-11-06 19:03:12,167 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 19:03:12,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25193 states. [2021-11-06 19:03:12,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25193 to 25193. [2021-11-06 19:03:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25193 states, 25161 states have (on average 1.2788442430745997) internal successors, (32177), 25192 states have internal predecessors, (32177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:12,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25193 states to 25193 states and 32177 transitions. [2021-11-06 19:03:12,760 INFO L78 Accepts]: Start accepts. Automaton has 25193 states and 32177 transitions. Word has length 85 [2021-11-06 19:03:12,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 19:03:12,761 INFO L470 AbstractCegarLoop]: Abstraction has 25193 states and 32177 transitions. [2021-11-06 19:03:12,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:12,761 INFO L276 IsEmpty]: Start isEmpty. Operand 25193 states and 32177 transitions. [2021-11-06 19:03:12,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-06 19:03:12,764 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 19:03:12,764 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 19:03:12,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 19:03:12,764 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 41 more)] === [2021-11-06 19:03:12,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 19:03:12,765 INFO L85 PathProgramCache]: Analyzing trace with hash 49126907, now seen corresponding path program 1 times [2021-11-06 19:03:12,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 19:03:12,765 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007066928] [2021-11-06 19:03:12,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 19:03:12,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 19:03:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 19:03:12,902 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-06 19:03:12,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 19:03:12,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007066928] [2021-11-06 19:03:12,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007066928] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 19:03:12,903 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 19:03:12,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 19:03:12,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133487496] [2021-11-06 19:03:12,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 19:03:12,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 19:03:12,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 19:03:12,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 19:03:12,906 INFO L87 Difference]: Start difference. First operand 25193 states and 32177 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:13,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 19:03:13,303 INFO L93 Difference]: Finished difference Result 25193 states and 32177 transitions. [2021-11-06 19:03:13,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 19:03:13,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-06 19:03:13,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 19:03:13,341 INFO L225 Difference]: With dead ends: 25193 [2021-11-06 19:03:13,341 INFO L226 Difference]: Without dead ends: 25187 [2021-11-06 19:03:13,352 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 19:03:13,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25187 states. [2021-11-06 19:03:13,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25187 to 25187. [2021-11-06 19:03:13,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25187 states, 25158 states have (on average 1.2787582478734398) internal successors, (32171), 25186 states have internal predecessors, (32171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:13,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25187 states to 25187 states and 32171 transitions. [2021-11-06 19:03:13,960 INFO L78 Accepts]: Start accepts. Automaton has 25187 states and 32171 transitions. Word has length 87 [2021-11-06 19:03:13,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 19:03:13,960 INFO L470 AbstractCegarLoop]: Abstraction has 25187 states and 32171 transitions. [2021-11-06 19:03:13,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:13,961 INFO L276 IsEmpty]: Start isEmpty. Operand 25187 states and 32171 transitions. [2021-11-06 19:03:13,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-06 19:03:13,963 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 19:03:13,964 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 19:03:13,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 19:03:13,964 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 41 more)] === [2021-11-06 19:03:13,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 19:03:13,964 INFO L85 PathProgramCache]: Analyzing trace with hash -33533218, now seen corresponding path program 1 times [2021-11-06 19:03:13,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 19:03:13,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591264953] [2021-11-06 19:03:13,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 19:03:13,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 19:03:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 19:03:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-06 19:03:14,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 19:03:14,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591264953] [2021-11-06 19:03:14,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591264953] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 19:03:14,077 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 19:03:14,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 19:03:14,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270054526] [2021-11-06 19:03:14,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 19:03:14,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 19:03:14,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 19:03:14,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 19:03:14,079 INFO L87 Difference]: Start difference. First operand 25187 states and 32171 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:14,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 19:03:14,500 INFO L93 Difference]: Finished difference Result 25187 states and 32171 transitions. [2021-11-06 19:03:14,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 19:03:14,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-11-06 19:03:14,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 19:03:14,539 INFO L225 Difference]: With dead ends: 25187 [2021-11-06 19:03:14,540 INFO L226 Difference]: Without dead ends: 25181 [2021-11-06 19:03:14,550 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 19:03:14,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25181 states. [2021-11-06 19:03:15,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25181 to 25181. [2021-11-06 19:03:15,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25181 states, 25155 states have (on average 1.2786722321606043) internal successors, (32165), 25180 states have internal predecessors, (32165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:15,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25181 states to 25181 states and 32165 transitions. [2021-11-06 19:03:15,187 INFO L78 Accepts]: Start accepts. Automaton has 25181 states and 32165 transitions. Word has length 89 [2021-11-06 19:03:15,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 19:03:15,187 INFO L470 AbstractCegarLoop]: Abstraction has 25181 states and 32165 transitions. [2021-11-06 19:03:15,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:15,187 INFO L276 IsEmpty]: Start isEmpty. Operand 25181 states and 32165 transitions. [2021-11-06 19:03:15,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-06 19:03:15,191 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 19:03:15,191 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 19:03:15,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 19:03:15,191 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 41 more)] === [2021-11-06 19:03:15,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 19:03:15,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2134465601, now seen corresponding path program 1 times [2021-11-06 19:03:15,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 19:03:15,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564397452] [2021-11-06 19:03:15,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 19:03:15,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 19:03:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 19:03:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-06 19:03:15,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 19:03:15,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564397452] [2021-11-06 19:03:15,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564397452] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 19:03:15,306 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 19:03:15,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 19:03:15,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117771981] [2021-11-06 19:03:15,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 19:03:15,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 19:03:15,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 19:03:15,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 19:03:15,307 INFO L87 Difference]: Start difference. First operand 25181 states and 32165 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:15,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 19:03:15,827 INFO L93 Difference]: Finished difference Result 25181 states and 32165 transitions. [2021-11-06 19:03:15,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 19:03:15,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-11-06 19:03:15,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 19:03:15,863 INFO L225 Difference]: With dead ends: 25181 [2021-11-06 19:03:15,864 INFO L226 Difference]: Without dead ends: 25175 [2021-11-06 19:03:15,874 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 19:03:15,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25175 states. [2021-11-06 19:03:16,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25175 to 25175. [2021-11-06 19:03:16,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25175 states, 25152 states have (on average 1.2785861959287532) internal successors, (32159), 25174 states have internal predecessors, (32159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25175 states to 25175 states and 32159 transitions. [2021-11-06 19:03:16,741 INFO L78 Accepts]: Start accepts. Automaton has 25175 states and 32159 transitions. Word has length 91 [2021-11-06 19:03:16,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 19:03:16,741 INFO L470 AbstractCegarLoop]: Abstraction has 25175 states and 32159 transitions. [2021-11-06 19:03:16,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:16,742 INFO L276 IsEmpty]: Start isEmpty. Operand 25175 states and 32159 transitions. [2021-11-06 19:03:16,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 19:03:16,745 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 19:03:16,746 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 19:03:16,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 19:03:16,746 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 41 more)] === [2021-11-06 19:03:16,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 19:03:16,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1772774876, now seen corresponding path program 1 times [2021-11-06 19:03:16,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 19:03:16,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336745360] [2021-11-06 19:03:16,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 19:03:16,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 19:03:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 19:03:16,853 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-06 19:03:16,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 19:03:16,854 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336745360] [2021-11-06 19:03:16,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336745360] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 19:03:16,854 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 19:03:16,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 19:03:16,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279752678] [2021-11-06 19:03:16,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 19:03:16,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 19:03:16,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 19:03:16,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 19:03:16,856 INFO L87 Difference]: Start difference. First operand 25175 states and 32159 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:17,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 19:03:17,679 INFO L93 Difference]: Finished difference Result 25175 states and 32159 transitions. [2021-11-06 19:03:17,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 19:03:17,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-11-06 19:03:17,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 19:03:17,708 INFO L225 Difference]: With dead ends: 25175 [2021-11-06 19:03:17,708 INFO L226 Difference]: Without dead ends: 25169 [2021-11-06 19:03:17,714 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 19:03:17,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25169 states. [2021-11-06 19:03:18,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25169 to 25169. [2021-11-06 19:03:18,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25169 states, 25149 states have (on average 1.2785001391705435) internal successors, (32153), 25168 states have internal predecessors, (32153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:18,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25169 states to 25169 states and 32153 transitions. [2021-11-06 19:03:18,275 INFO L78 Accepts]: Start accepts. Automaton has 25169 states and 32153 transitions. Word has length 93 [2021-11-06 19:03:18,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 19:03:18,276 INFO L470 AbstractCegarLoop]: Abstraction has 25169 states and 32153 transitions. [2021-11-06 19:03:18,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:18,276 INFO L276 IsEmpty]: Start isEmpty. Operand 25169 states and 32153 transitions. [2021-11-06 19:03:18,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-06 19:03:18,280 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 19:03:18,280 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 19:03:18,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 19:03:18,280 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 41 more)] === [2021-11-06 19:03:18,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 19:03:18,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1465511047, now seen corresponding path program 1 times [2021-11-06 19:03:18,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 19:03:18,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351457233] [2021-11-06 19:03:18,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 19:03:18,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 19:03:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 19:03:18,383 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-06 19:03:18,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 19:03:18,383 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351457233] [2021-11-06 19:03:18,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351457233] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 19:03:18,383 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 19:03:18,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 19:03:18,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735765954] [2021-11-06 19:03:18,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 19:03:18,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 19:03:18,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 19:03:18,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 19:03:18,385 INFO L87 Difference]: Start difference. First operand 25169 states and 32153 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:18,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 19:03:18,923 INFO L93 Difference]: Finished difference Result 25169 states and 32153 transitions. [2021-11-06 19:03:18,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 19:03:18,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-11-06 19:03:18,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 19:03:18,961 INFO L225 Difference]: With dead ends: 25169 [2021-11-06 19:03:18,961 INFO L226 Difference]: Without dead ends: 25163 [2021-11-06 19:03:18,971 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 19:03:18,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25163 states. [2021-11-06 19:03:19,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25163 to 25163. [2021-11-06 19:03:19,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25163 states, 25146 states have (on average 1.2784140618786288) internal successors, (32147), 25162 states have internal predecessors, (32147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25163 states to 25163 states and 32147 transitions. [2021-11-06 19:03:19,721 INFO L78 Accepts]: Start accepts. Automaton has 25163 states and 32147 transitions. Word has length 95 [2021-11-06 19:03:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 19:03:19,721 INFO L470 AbstractCegarLoop]: Abstraction has 25163 states and 32147 transitions. [2021-11-06 19:03:19,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 25163 states and 32147 transitions. [2021-11-06 19:03:19,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-06 19:03:19,725 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 19:03:19,725 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 19:03:19,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 19:03:19,726 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 41 more)] === [2021-11-06 19:03:19,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 19:03:19,726 INFO L85 PathProgramCache]: Analyzing trace with hash -393006230, now seen corresponding path program 1 times [2021-11-06 19:03:19,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 19:03:19,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364429869] [2021-11-06 19:03:19,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 19:03:19,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 19:03:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 19:03:19,824 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-06 19:03:19,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 19:03:19,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364429869] [2021-11-06 19:03:19,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364429869] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 19:03:19,825 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 19:03:19,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 19:03:19,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503893157] [2021-11-06 19:03:19,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 19:03:19,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 19:03:19,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 19:03:19,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 19:03:19,826 INFO L87 Difference]: Start difference. First operand 25163 states and 32147 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:20,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 19:03:20,347 INFO L93 Difference]: Finished difference Result 25163 states and 32147 transitions. [2021-11-06 19:03:20,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 19:03:20,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-11-06 19:03:20,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 19:03:20,384 INFO L225 Difference]: With dead ends: 25163 [2021-11-06 19:03:20,384 INFO L226 Difference]: Without dead ends: 25157 [2021-11-06 19:03:20,395 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 19:03:20,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25157 states. [2021-11-06 19:03:21,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25157 to 25157. [2021-11-06 19:03:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25157 states, 25143 states have (on average 1.2783279640456588) internal successors, (32141), 25156 states have internal predecessors, (32141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25157 states to 25157 states and 32141 transitions. [2021-11-06 19:03:21,127 INFO L78 Accepts]: Start accepts. Automaton has 25157 states and 32141 transitions. Word has length 97 [2021-11-06 19:03:21,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 19:03:21,127 INFO L470 AbstractCegarLoop]: Abstraction has 25157 states and 32141 transitions. [2021-11-06 19:03:21,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 25157 states and 32141 transitions. [2021-11-06 19:03:21,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-06 19:03:21,131 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 19:03:21,131 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 19:03:21,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 19:03:21,131 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 41 more)] === [2021-11-06 19:03:21,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 19:03:21,132 INFO L85 PathProgramCache]: Analyzing trace with hash 278286029, now seen corresponding path program 1 times [2021-11-06 19:03:21,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 19:03:21,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029807341] [2021-11-06 19:03:21,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 19:03:21,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 19:03:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 19:03:21,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-06 19:03:21,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 19:03:21,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029807341] [2021-11-06 19:03:21,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029807341] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 19:03:21,231 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 19:03:21,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 19:03:21,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289288762] [2021-11-06 19:03:21,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 19:03:21,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 19:03:21,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 19:03:21,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 19:03:21,232 INFO L87 Difference]: Start difference. First operand 25157 states and 32141 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:21,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 19:03:21,956 INFO L93 Difference]: Finished difference Result 25157 states and 32141 transitions. [2021-11-06 19:03:21,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 19:03:21,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-06 19:03:21,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 19:03:21,988 INFO L225 Difference]: With dead ends: 25157 [2021-11-06 19:03:21,989 INFO L226 Difference]: Without dead ends: 25151 [2021-11-06 19:03:21,997 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 19:03:22,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25151 states. [2021-11-06 19:03:22,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25151 to 25151. [2021-11-06 19:03:22,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25151 states, 25140 states have (on average 1.2782418456642801) internal successors, (32135), 25150 states have internal predecessors, (32135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:22,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25151 states to 25151 states and 32135 transitions. [2021-11-06 19:03:22,932 INFO L78 Accepts]: Start accepts. Automaton has 25151 states and 32135 transitions. Word has length 99 [2021-11-06 19:03:22,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 19:03:22,932 INFO L470 AbstractCegarLoop]: Abstraction has 25151 states and 32135 transitions. [2021-11-06 19:03:22,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:22,932 INFO L276 IsEmpty]: Start isEmpty. Operand 25151 states and 32135 transitions. [2021-11-06 19:03:22,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-06 19:03:22,936 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 19:03:22,936 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 19:03:22,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 19:03:22,937 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 41 more)] === [2021-11-06 19:03:22,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 19:03:22,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1145052848, now seen corresponding path program 1 times [2021-11-06 19:03:22,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 19:03:22,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852828768] [2021-11-06 19:03:22,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 19:03:22,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 19:03:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 19:03:23,038 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-06 19:03:23,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 19:03:23,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852828768] [2021-11-06 19:03:23,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852828768] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 19:03:23,039 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 19:03:23,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 19:03:23,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010401495] [2021-11-06 19:03:23,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 19:03:23,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 19:03:23,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 19:03:23,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 19:03:23,040 INFO L87 Difference]: Start difference. First operand 25151 states and 32135 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:23,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 19:03:23,772 INFO L93 Difference]: Finished difference Result 25151 states and 32135 transitions. [2021-11-06 19:03:23,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 19:03:23,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-11-06 19:03:23,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 19:03:23,808 INFO L225 Difference]: With dead ends: 25151 [2021-11-06 19:03:23,808 INFO L226 Difference]: Without dead ends: 24885 [2021-11-06 19:03:23,819 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 19:03:23,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24885 states. [2021-11-06 19:03:24,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24885 to 24885. [2021-11-06 19:03:24,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24885 states, 24877 states have (on average 1.2778872050488403) internal successors, (31790), 24884 states have internal predecessors, (31790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:24,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24885 states to 24885 states and 31790 transitions. [2021-11-06 19:03:24,586 INFO L78 Accepts]: Start accepts. Automaton has 24885 states and 31790 transitions. Word has length 101 [2021-11-06 19:03:24,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 19:03:24,586 INFO L470 AbstractCegarLoop]: Abstraction has 24885 states and 31790 transitions. [2021-11-06 19:03:24,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:24,586 INFO L276 IsEmpty]: Start isEmpty. Operand 24885 states and 31790 transitions. [2021-11-06 19:03:24,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-11-06 19:03:24,591 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 19:03:24,592 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 19:03:24,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 19:03:24,592 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 41 more)] === [2021-11-06 19:03:24,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 19:03:24,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2068005044, now seen corresponding path program 1 times [2021-11-06 19:03:24,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 19:03:24,593 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465843328] [2021-11-06 19:03:24,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 19:03:24,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 19:03:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 19:03:24,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 19:03:24,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 19:03:24,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465843328] [2021-11-06 19:03:24,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465843328] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 19:03:24,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 19:03:24,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 19:03:24,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644187881] [2021-11-06 19:03:24,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 19:03:24,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 19:03:24,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 19:03:24,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 19:03:24,691 INFO L87 Difference]: Start difference. First operand 24885 states and 31790 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 19:03:27,417 INFO L93 Difference]: Finished difference Result 55754 states and 71471 transitions. [2021-11-06 19:03:27,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 19:03:27,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2021-11-06 19:03:27,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 19:03:27,478 INFO L225 Difference]: With dead ends: 55754 [2021-11-06 19:03:27,478 INFO L226 Difference]: Without dead ends: 31109 [2021-11-06 19:03:27,521 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 19:03:27,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31109 states. [2021-11-06 19:03:28,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31109 to 31077. [2021-11-06 19:03:28,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31077 states, 31069 states have (on average 1.2804724967008916) internal successors, (39783), 31076 states have internal predecessors, (39783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:28,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31077 states to 31077 states and 39783 transitions. [2021-11-06 19:03:28,633 INFO L78 Accepts]: Start accepts. Automaton has 31077 states and 39783 transitions. Word has length 113 [2021-11-06 19:03:28,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 19:03:28,633 INFO L470 AbstractCegarLoop]: Abstraction has 31077 states and 39783 transitions. [2021-11-06 19:03:28,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:28,634 INFO L276 IsEmpty]: Start isEmpty. Operand 31077 states and 39783 transitions. [2021-11-06 19:03:28,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-11-06 19:03:28,641 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 19:03:28,642 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 19:03:28,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 19:03:28,642 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 41 more)] === [2021-11-06 19:03:28,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 19:03:28,643 INFO L85 PathProgramCache]: Analyzing trace with hash 611874147, now seen corresponding path program 1 times [2021-11-06 19:03:28,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 19:03:28,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944705616] [2021-11-06 19:03:28,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 19:03:28,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 19:03:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 19:03:28,773 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-06 19:03:28,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 19:03:28,773 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944705616] [2021-11-06 19:03:28,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944705616] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 19:03:28,774 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 19:03:28,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 19:03:28,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924964130] [2021-11-06 19:03:28,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 19:03:28,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 19:03:28,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 19:03:28,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 19:03:28,775 INFO L87 Difference]: Start difference. First operand 31077 states and 39783 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:30,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 19:03:30,835 INFO L93 Difference]: Finished difference Result 68138 states and 87457 transitions. [2021-11-06 19:03:30,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 19:03:30,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2021-11-06 19:03:30,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 19:03:30,889 INFO L225 Difference]: With dead ends: 68138 [2021-11-06 19:03:30,889 INFO L226 Difference]: Without dead ends: 37301 [2021-11-06 19:03:30,923 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 19:03:30,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37301 states. [2021-11-06 19:03:32,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37301 to 37269. [2021-11-06 19:03:32,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37269 states, 37261 states have (on average 1.2834599178766002) internal successors, (47823), 37268 states have internal predecessors, (47823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37269 states to 37269 states and 47823 transitions. [2021-11-06 19:03:32,232 INFO L78 Accepts]: Start accepts. Automaton has 37269 states and 47823 transitions. Word has length 150 [2021-11-06 19:03:32,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 19:03:32,232 INFO L470 AbstractCegarLoop]: Abstraction has 37269 states and 47823 transitions. [2021-11-06 19:03:32,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:32,232 INFO L276 IsEmpty]: Start isEmpty. Operand 37269 states and 47823 transitions. [2021-11-06 19:03:32,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-11-06 19:03:32,239 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 19:03:32,239 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 19:03:32,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 19:03:32,239 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 41 more)] === [2021-11-06 19:03:32,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 19:03:32,241 INFO L85 PathProgramCache]: Analyzing trace with hash -645976847, now seen corresponding path program 1 times [2021-11-06 19:03:32,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 19:03:32,241 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538656039] [2021-11-06 19:03:32,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 19:03:32,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 19:03:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 19:03:32,331 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-06 19:03:32,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 19:03:32,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538656039] [2021-11-06 19:03:32,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538656039] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 19:03:32,332 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 19:03:32,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 19:03:32,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598508429] [2021-11-06 19:03:32,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 19:03:32,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 19:03:32,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 19:03:32,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 19:03:32,334 INFO L87 Difference]: Start difference. First operand 37269 states and 47823 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:35,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 19:03:35,980 INFO L93 Difference]: Finished difference Result 80462 states and 103298 transitions. [2021-11-06 19:03:35,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 19:03:35,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 177 [2021-11-06 19:03:35,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 19:03:36,068 INFO L225 Difference]: With dead ends: 80462 [2021-11-06 19:03:36,069 INFO L226 Difference]: Without dead ends: 43276 [2021-11-06 19:03:36,119 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 19:03:36,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43276 states. [2021-11-06 19:03:37,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43276 to 43244. [2021-11-06 19:03:37,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43244 states, 43236 states have (on average 1.2842538625219724) internal successors, (55526), 43243 states have internal predecessors, (55526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:37,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43244 states to 43244 states and 55526 transitions. [2021-11-06 19:03:37,607 INFO L78 Accepts]: Start accepts. Automaton has 43244 states and 55526 transitions. Word has length 177 [2021-11-06 19:03:37,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 19:03:37,608 INFO L470 AbstractCegarLoop]: Abstraction has 43244 states and 55526 transitions. [2021-11-06 19:03:37,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:37,608 INFO L276 IsEmpty]: Start isEmpty. Operand 43244 states and 55526 transitions. [2021-11-06 19:03:37,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-11-06 19:03:37,616 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 19:03:37,619 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 19:03:37,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 19:03:37,620 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 41 more)] === [2021-11-06 19:03:37,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 19:03:37,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1571653551, now seen corresponding path program 1 times [2021-11-06 19:03:37,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 19:03:37,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587123770] [2021-11-06 19:03:37,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 19:03:37,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 19:03:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 19:03:37,707 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-06 19:03:37,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 19:03:37,707 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587123770] [2021-11-06 19:03:37,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587123770] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 19:03:37,708 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 19:03:37,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 19:03:37,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494941440] [2021-11-06 19:03:37,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 19:03:37,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 19:03:37,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 19:03:37,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 19:03:37,709 INFO L87 Difference]: Start difference. First operand 43244 states and 55526 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:39,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 19:03:39,870 INFO L93 Difference]: Finished difference Result 92472 states and 118823 transitions. [2021-11-06 19:03:39,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 19:03:39,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 177 [2021-11-06 19:03:39,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 19:03:39,957 INFO L225 Difference]: With dead ends: 92472 [2021-11-06 19:03:39,958 INFO L226 Difference]: Without dead ends: 49468 [2021-11-06 19:03:40,015 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 19:03:40,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49468 states. [2021-11-06 19:03:41,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49468 to 49436. [2021-11-06 19:03:41,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49436 states, 49428 states have (on average 1.2853241077931536) internal successors, (63531), 49435 states have internal predecessors, (63531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:42,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49436 states to 49436 states and 63531 transitions. [2021-11-06 19:03:42,018 INFO L78 Accepts]: Start accepts. Automaton has 49436 states and 63531 transitions. Word has length 177 [2021-11-06 19:03:42,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 19:03:42,018 INFO L470 AbstractCegarLoop]: Abstraction has 49436 states and 63531 transitions. [2021-11-06 19:03:42,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:42,019 INFO L276 IsEmpty]: Start isEmpty. Operand 49436 states and 63531 transitions. [2021-11-06 19:03:42,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2021-11-06 19:03:42,026 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 19:03:42,027 INFO L513 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 19:03:42,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 19:03:42,027 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 41 more)] === [2021-11-06 19:03:42,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 19:03:42,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1109570787, now seen corresponding path program 1 times [2021-11-06 19:03:42,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 19:03:42,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643062366] [2021-11-06 19:03:42,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 19:03:42,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 19:03:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 19:03:42,137 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-11-06 19:03:42,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 19:03:42,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643062366] [2021-11-06 19:03:42,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643062366] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 19:03:42,138 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 19:03:42,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 19:03:42,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238877873] [2021-11-06 19:03:42,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 19:03:42,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 19:03:42,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 19:03:42,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 19:03:42,139 INFO L87 Difference]: Start difference. First operand 49436 states and 63531 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 19:03:46,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 19:03:46,132 INFO L93 Difference]: Finished difference Result 153644 states and 197557 transitions. [2021-11-06 19:03:46,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 19:03:46,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 212 [2021-11-06 19:03:46,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 19:03:46,332 INFO L225 Difference]: With dead ends: 153644 [2021-11-06 19:03:46,333 INFO L226 Difference]: Without dead ends: 104448 [2021-11-06 19:03:46,401 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 19:03:46,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104448 states.