./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-34.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '6879d183ea614705b8dec9095f843a55526481f961ca46c6ec00dfff8309d4ce'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-34.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6879d183ea614705b8dec9095f843a55526481f961ca46c6ec00dfff8309d4ce --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:49:34,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:49:34,498 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 09:49:34,502 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:49:34,503 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:49:34,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:49:34,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:49:34,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:49:34,533 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:49:34,534 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:49:34,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:49:34,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:49:34,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:49:34,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:49:34,535 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:49:34,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:49:34,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:49:34,535 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:49:34,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 09:49:34,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:49:34,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:49:34,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:49:34,536 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:49:34,536 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:49:34,536 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:49:34,536 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:49:34,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:49:34,536 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:49:34,536 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:49:34,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:49:34,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:49:34,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:49:34,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:49:34,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:49:34,537 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:49:34,537 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:49:34,537 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 09:49:34,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 09:49:34,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:49:34,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:49:34,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:49:34,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:49:34,537 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6879d183ea614705b8dec9095f843a55526481f961ca46c6ec00dfff8309d4ce [2024-11-07 09:49:34,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:49:34,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:49:34,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:49:34,829 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:49:34,829 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:49:34,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-34.i [2024-11-07 09:49:36,101 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:49:36,399 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:49:36,400 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-34.i [2024-11-07 09:49:36,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8e7266e2/8d7b52e37cc6416995ef9500f5852306/FLAG1fecf1eb9 [2024-11-07 09:49:36,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8e7266e2/8d7b52e37cc6416995ef9500f5852306 [2024-11-07 09:49:36,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:49:36,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:49:36,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:49:36,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:49:36,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:49:36,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:49:36" (1/1) ... [2024-11-07 09:49:36,451 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ccbf2fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:49:36, skipping insertion in model container [2024-11-07 09:49:36,451 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:49:36" (1/1) ... [2024-11-07 09:49:36,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:49:36,604 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-34.i[915,928] [2024-11-07 09:49:36,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:49:36,672 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:49:36,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-34.i[915,928] [2024-11-07 09:49:36,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:49:36,718 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:49:36,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:49:36 WrapperNode [2024-11-07 09:49:36,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:49:36,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:49:36,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:49:36,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:49:36,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:49:36" (1/1) ... [2024-11-07 09:49:36,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:49:36" (1/1) ... [2024-11-07 09:49:36,774 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2024-11-07 09:49:36,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:49:36,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:49:36,775 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:49:36,775 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:49:36,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:49:36" (1/1) ... [2024-11-07 09:49:36,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:49:36" (1/1) ... [2024-11-07 09:49:36,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:49:36" (1/1) ... [2024-11-07 09:49:36,814 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 09:49:36,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:49:36" (1/1) ... [2024-11-07 09:49:36,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:49:36" (1/1) ... [2024-11-07 09:49:36,828 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:49:36" (1/1) ... [2024-11-07 09:49:36,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:49:36" (1/1) ... [2024-11-07 09:49:36,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:49:36" (1/1) ... [2024-11-07 09:49:36,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:49:36" (1/1) ... [2024-11-07 09:49:36,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:49:36,842 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:49:36,842 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:49:36,842 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:49:36,843 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:49:36" (1/1) ... [2024-11-07 09:49:36,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:49:36,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:49:36,878 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 09:49:36,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 09:49:36,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:49:36,903 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:49:36,903 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:49:36,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 09:49:36,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:49:36,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:49:36,986 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:49:36,988 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:49:37,376 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-07 09:49:37,376 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:49:37,387 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:49:37,388 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:49:37,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:49:37 BoogieIcfgContainer [2024-11-07 09:49:37,389 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:49:37,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:49:37,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:49:37,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:49:37,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:49:36" (1/3) ... [2024-11-07 09:49:37,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2829a476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:49:37, skipping insertion in model container [2024-11-07 09:49:37,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:49:36" (2/3) ... [2024-11-07 09:49:37,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2829a476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:49:37, skipping insertion in model container [2024-11-07 09:49:37,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:49:37" (3/3) ... [2024-11-07 09:49:37,399 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-34.i [2024-11-07 09:49:37,411 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:49:37,412 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:49:37,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:49:37,481 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@40337e3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:49:37,482 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:49:37,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 09:49:37,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 09:49:37,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:49:37,498 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:49:37,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:49:37,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:49:37,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1167158208, now seen corresponding path program 1 times [2024-11-07 09:49:37,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:49:37,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077312575] [2024-11-07 09:49:37,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:49:37,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:49:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:37,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:49:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:37,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:49:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:37,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 09:49:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:37,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:49:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:37,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 09:49:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:37,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:49:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:37,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 09:49:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:37,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:49:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:37,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 09:49:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:37,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:49:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:37,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 09:49:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:37,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:49:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:37,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:49:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:37,779 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 09:49:37,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:49:37,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077312575] [2024-11-07 09:49:37,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077312575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:49:37,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:49:37,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:49:37,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913183119] [2024-11-07 09:49:37,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:49:37,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:49:37,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:49:37,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:49:37,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:49:37,805 INFO L87 Difference]: Start difference. First operand has 71 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 09:49:37,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:49:37,826 INFO L93 Difference]: Finished difference Result 135 states and 223 transitions. [2024-11-07 09:49:37,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:49:37,828 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 94 [2024-11-07 09:49:37,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:49:37,834 INFO L225 Difference]: With dead ends: 135 [2024-11-07 09:49:37,835 INFO L226 Difference]: Without dead ends: 67 [2024-11-07 09:49:37,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:49:37,844 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:49:37,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:49:37,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-07 09:49:37,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-07 09:49:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 09:49:37,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2024-11-07 09:49:37,879 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 94 [2024-11-07 09:49:37,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:49:37,879 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2024-11-07 09:49:37,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 09:49:37,879 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2024-11-07 09:49:37,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 09:49:37,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:49:37,882 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:49:37,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 09:49:37,883 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:49:37,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:49:37,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1294889278, now seen corresponding path program 1 times [2024-11-07 09:49:37,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:49:37,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767681330] [2024-11-07 09:49:37,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:49:37,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:49:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:38,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:49:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:38,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:49:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:38,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 09:49:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:38,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:49:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:38,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 09:49:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:38,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:49:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:38,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 09:49:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:38,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:49:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:38,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 09:49:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:38,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:49:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:38,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 09:49:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:38,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:49:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:38,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:49:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:38,449 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 09:49:38,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:49:38,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767681330] [2024-11-07 09:49:38,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767681330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:49:38,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:49:38,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 09:49:38,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103557550] [2024-11-07 09:49:38,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:49:38,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 09:49:38,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:49:38,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 09:49:38,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 09:49:38,455 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:49:38,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:49:38,610 INFO L93 Difference]: Finished difference Result 225 states and 342 transitions. [2024-11-07 09:49:38,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 09:49:38,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-11-07 09:49:38,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:49:38,613 INFO L225 Difference]: With dead ends: 225 [2024-11-07 09:49:38,613 INFO L226 Difference]: Without dead ends: 161 [2024-11-07 09:49:38,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 09:49:38,617 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 129 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:49:38,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 321 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:49:38,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-07 09:49:38,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 131. [2024-11-07 09:49:38,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 102 states have (on average 1.4411764705882353) internal successors, (147), 102 states have internal predecessors, (147), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 09:49:38,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 199 transitions. [2024-11-07 09:49:38,641 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 199 transitions. Word has length 94 [2024-11-07 09:49:38,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:49:38,641 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 199 transitions. [2024-11-07 09:49:38,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:49:38,642 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 199 transitions. [2024-11-07 09:49:38,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 09:49:38,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:49:38,643 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:49:38,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 09:49:38,643 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:49:38,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:49:38,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1947848368, now seen corresponding path program 1 times [2024-11-07 09:49:38,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:49:38,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817457529] [2024-11-07 09:49:38,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:49:38,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:49:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:38,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:49:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:38,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:49:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:38,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 09:49:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:38,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:49:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:38,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 09:49:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:38,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:49:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:38,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 09:49:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:38,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:49:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:38,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 09:49:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:38,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:49:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:39,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 09:49:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:39,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:49:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:39,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:49:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:49:39,015 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 09:49:39,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:49:39,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817457529] [2024-11-07 09:49:39,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817457529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:49:39,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:49:39,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 09:49:39,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299879156] [2024-11-07 09:49:39,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:49:39,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 09:49:39,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:49:39,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 09:49:39,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 09:49:39,020 INFO L87 Difference]: Start difference. First operand 131 states and 199 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:49:39,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:49:39,281 INFO L93 Difference]: Finished difference Result 382 states and 580 transitions. [2024-11-07 09:49:39,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 09:49:39,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 95 [2024-11-07 09:49:39,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:49:39,285 INFO L225 Difference]: With dead ends: 382 [2024-11-07 09:49:39,287 INFO L226 Difference]: Without dead ends: 254 [2024-11-07 09:49:39,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 09:49:39,291 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 125 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 09:49:39,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 329 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 09:49:39,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-07 09:49:39,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 135. [2024-11-07 09:49:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 106 states have (on average 1.4245283018867925) internal successors, (151), 106 states have internal predecessors, (151), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 09:49:39,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 203 transitions. [2024-11-07 09:49:39,331 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 203 transitions. Word has length 95 [2024-11-07 09:49:39,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:49:39,333 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 203 transitions. [2024-11-07 09:49:39,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:49:39,333 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 203 transitions. [2024-11-07 09:49:39,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 09:49:39,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:49:39,337 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:49:39,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 09:49:39,337 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:49:39,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:49:39,337 INFO L85 PathProgramCache]: Analyzing trace with hash 343445546, now seen corresponding path program 1 times [2024-11-07 09:49:39,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:49:39,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437384665] [2024-11-07 09:49:39,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:49:39,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:49:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:00,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:50:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:00,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:50:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:00,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 09:50:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:00,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:50:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:00,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 09:50:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:00,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:50:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:00,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 09:50:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:00,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:50:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:00,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 09:50:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:00,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:50:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:00,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 09:50:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:00,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:50:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:00,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:50:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:00,793 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 09:50:00,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:50:00,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437384665] [2024-11-07 09:50:00,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437384665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:50:00,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:50:00,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 09:50:00,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276284388] [2024-11-07 09:50:00,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:50:00,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 09:50:00,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:50:00,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 09:50:00,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-07 09:50:00,802 INFO L87 Difference]: Start difference. First operand 135 states and 203 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:50:04,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:50:04,395 INFO L93 Difference]: Finished difference Result 535 states and 786 transitions. [2024-11-07 09:50:04,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 09:50:04,396 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-07 09:50:04,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:50:04,399 INFO L225 Difference]: With dead ends: 535 [2024-11-07 09:50:04,399 INFO L226 Difference]: Without dead ends: 403 [2024-11-07 09:50:04,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2024-11-07 09:50:04,401 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 378 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:50:04,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 586 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-07 09:50:04,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-07 09:50:04,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 249. [2024-11-07 09:50:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 206 states have (on average 1.4223300970873787) internal successors, (293), 206 states have internal predecessors, (293), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 09:50:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 371 transitions. [2024-11-07 09:50:04,435 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 371 transitions. Word has length 96 [2024-11-07 09:50:04,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:50:04,436 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 371 transitions. [2024-11-07 09:50:04,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:50:04,439 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 371 transitions. [2024-11-07 09:50:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 09:50:04,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:50:04,441 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:50:04,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 09:50:04,441 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:50:04,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:50:04,441 INFO L85 PathProgramCache]: Analyzing trace with hash 2118452908, now seen corresponding path program 1 times [2024-11-07 09:50:04,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:50:04,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956179818] [2024-11-07 09:50:04,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:50:04,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:50:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:06,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:50:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:06,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:50:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:06,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 09:50:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:06,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:50:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:06,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 09:50:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:06,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:50:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:06,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 09:50:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:06,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:50:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:06,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 09:50:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:06,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:50:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:06,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 09:50:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:06,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:50:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:06,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:50:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:06,488 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 09:50:06,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:50:06,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956179818] [2024-11-07 09:50:06,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956179818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:50:06,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:50:06,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 09:50:06,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717202758] [2024-11-07 09:50:06,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:50:06,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 09:50:06,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:50:06,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 09:50:06,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 09:50:06,492 INFO L87 Difference]: Start difference. First operand 249 states and 371 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:50:07,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:50:07,627 INFO L93 Difference]: Finished difference Result 608 states and 909 transitions. [2024-11-07 09:50:07,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 09:50:07,628 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-07 09:50:07,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:50:07,631 INFO L225 Difference]: With dead ends: 608 [2024-11-07 09:50:07,631 INFO L226 Difference]: Without dead ends: 460 [2024-11-07 09:50:07,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-07 09:50:07,634 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 362 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 09:50:07,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 376 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 09:50:07,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-07 09:50:07,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 294. [2024-11-07 09:50:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 251 states have (on average 1.4183266932270917) internal successors, (356), 251 states have internal predecessors, (356), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 09:50:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 434 transitions. [2024-11-07 09:50:07,663 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 434 transitions. Word has length 96 [2024-11-07 09:50:07,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:50:07,664 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 434 transitions. [2024-11-07 09:50:07,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:50:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 434 transitions. [2024-11-07 09:50:07,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 09:50:07,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:50:07,665 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:50:07,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 09:50:07,666 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:50:07,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:50:07,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1023503916, now seen corresponding path program 1 times [2024-11-07 09:50:07,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:50:07,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385828256] [2024-11-07 09:50:07,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:50:07,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:50:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:11,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:50:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:11,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:50:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:11,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 09:50:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:11,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:50:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:11,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 09:50:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:11,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:50:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:11,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 09:50:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:11,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:50:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:11,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 09:50:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:11,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:50:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:11,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 09:50:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:11,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:50:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:11,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:50:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:11,498 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 09:50:11,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:50:11,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385828256] [2024-11-07 09:50:11,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385828256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:50:11,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:50:11,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 09:50:11,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178784789] [2024-11-07 09:50:11,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:50:11,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 09:50:11,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:50:11,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 09:50:11,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 09:50:11,502 INFO L87 Difference]: Start difference. First operand 294 states and 434 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:50:12,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:50:12,749 INFO L93 Difference]: Finished difference Result 602 states and 884 transitions. [2024-11-07 09:50:12,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 09:50:12,749 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-07 09:50:12,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:50:12,752 INFO L225 Difference]: With dead ends: 602 [2024-11-07 09:50:12,752 INFO L226 Difference]: Without dead ends: 456 [2024-11-07 09:50:12,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2024-11-07 09:50:12,753 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 366 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 09:50:12,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 448 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 09:50:12,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-07 09:50:12,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 354. [2024-11-07 09:50:12,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 311 states have (on average 1.459807073954984) internal successors, (454), 311 states have internal predecessors, (454), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 09:50:12,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 532 transitions. [2024-11-07 09:50:12,780 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 532 transitions. Word has length 96 [2024-11-07 09:50:12,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:50:12,781 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 532 transitions. [2024-11-07 09:50:12,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:50:12,782 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 532 transitions. [2024-11-07 09:50:12,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 09:50:12,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:50:12,784 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:50:12,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 09:50:12,784 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:50:12,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:50:12,784 INFO L85 PathProgramCache]: Analyzing trace with hash -926687525, now seen corresponding path program 1 times [2024-11-07 09:50:12,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:50:12,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869472256] [2024-11-07 09:50:12,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:50:12,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:50:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:13,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:50:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:13,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:50:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:13,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 09:50:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:13,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:50:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:13,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 09:50:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:13,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:50:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:13,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 09:50:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:13,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:50:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:13,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 09:50:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:13,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:50:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:13,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 09:50:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:13,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:50:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:13,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:50:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 09:50:13,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:50:13,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869472256] [2024-11-07 09:50:13,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869472256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:50:13,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:50:13,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 09:50:13,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237866522] [2024-11-07 09:50:13,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:50:13,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 09:50:13,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:50:13,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 09:50:13,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 09:50:13,994 INFO L87 Difference]: Start difference. First operand 354 states and 532 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:50:14,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:50:14,408 INFO L93 Difference]: Finished difference Result 656 states and 980 transitions. [2024-11-07 09:50:14,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 09:50:14,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-07 09:50:14,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:50:14,412 INFO L225 Difference]: With dead ends: 656 [2024-11-07 09:50:14,412 INFO L226 Difference]: Without dead ends: 472 [2024-11-07 09:50:14,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-07 09:50:14,414 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 156 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 09:50:14,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 345 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 09:50:14,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-07 09:50:14,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 360. [2024-11-07 09:50:14,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 317 states have (on average 1.444794952681388) internal successors, (458), 317 states have internal predecessors, (458), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 09:50:14,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 536 transitions. [2024-11-07 09:50:14,444 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 536 transitions. Word has length 96 [2024-11-07 09:50:14,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:50:14,445 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 536 transitions. [2024-11-07 09:50:14,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:50:14,445 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 536 transitions. [2024-11-07 09:50:14,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 09:50:14,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:50:14,446 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:50:14,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 09:50:14,447 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:50:14,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:50:14,447 INFO L85 PathProgramCache]: Analyzing trace with hash -667671704, now seen corresponding path program 1 times [2024-11-07 09:50:14,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:50:14,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851466651] [2024-11-07 09:50:14,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:50:14,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:50:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:14,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:50:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:14,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:50:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:14,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 09:50:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:14,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:50:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:14,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 09:50:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:14,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:50:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:14,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 09:50:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:14,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:50:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:14,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 09:50:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:14,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:50:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:14,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 09:50:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:14,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:50:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:14,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:50:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:14,673 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 09:50:14,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:50:14,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851466651] [2024-11-07 09:50:14,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851466651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:50:14,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:50:14,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 09:50:14,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003906217] [2024-11-07 09:50:14,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:50:14,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 09:50:14,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:50:14,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 09:50:14,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 09:50:14,675 INFO L87 Difference]: Start difference. First operand 360 states and 536 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:50:14,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:50:14,851 INFO L93 Difference]: Finished difference Result 576 states and 859 transitions. [2024-11-07 09:50:14,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 09:50:14,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-07 09:50:14,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:50:14,854 INFO L225 Difference]: With dead ends: 576 [2024-11-07 09:50:14,854 INFO L226 Difference]: Without dead ends: 350 [2024-11-07 09:50:14,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 09:50:14,855 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 81 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:50:14,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 230 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:50:14,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-07 09:50:14,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 322. [2024-11-07 09:50:14,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 279 states have (on average 1.4050179211469533) internal successors, (392), 279 states have internal predecessors, (392), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 09:50:14,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 470 transitions. [2024-11-07 09:50:14,888 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 470 transitions. Word has length 96 [2024-11-07 09:50:14,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:50:14,888 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 470 transitions. [2024-11-07 09:50:14,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:50:14,889 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 470 transitions. [2024-11-07 09:50:14,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 09:50:14,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:50:14,890 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:50:14,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 09:50:14,890 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:50:14,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:50:14,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1326331525, now seen corresponding path program 1 times [2024-11-07 09:50:14,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:50:14,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298611451] [2024-11-07 09:50:14,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:50:14,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:50:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:16,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:50:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:16,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:50:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:16,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 09:50:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:16,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:50:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:16,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 09:50:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:16,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:50:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:16,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 09:50:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:16,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:50:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:16,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 09:50:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:16,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:50:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:16,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 09:50:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:16,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:50:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:16,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:50:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:16,932 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 09:50:16,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:50:16,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298611451] [2024-11-07 09:50:16,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298611451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:50:16,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:50:16,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 09:50:16,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666184426] [2024-11-07 09:50:16,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:50:16,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 09:50:16,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:50:16,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 09:50:16,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-07 09:50:16,935 INFO L87 Difference]: Start difference. First operand 322 states and 470 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:50:17,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:50:17,947 INFO L93 Difference]: Finished difference Result 647 states and 936 transitions. [2024-11-07 09:50:17,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 09:50:17,948 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2024-11-07 09:50:17,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:50:17,951 INFO L225 Difference]: With dead ends: 647 [2024-11-07 09:50:17,951 INFO L226 Difference]: Without dead ends: 515 [2024-11-07 09:50:17,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-07 09:50:17,954 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 260 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 09:50:17,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 480 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 09:50:17,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-11-07 09:50:17,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 358. [2024-11-07 09:50:17,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 313 states have (on average 1.3738019169329074) internal successors, (430), 313 states have internal predecessors, (430), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 09:50:17,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 508 transitions. [2024-11-07 09:50:17,983 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 508 transitions. Word has length 97 [2024-11-07 09:50:17,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:50:17,984 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 508 transitions. [2024-11-07 09:50:17,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:50:17,984 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 508 transitions. [2024-11-07 09:50:17,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 09:50:17,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:50:17,987 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:50:17,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 09:50:17,988 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:50:17,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:50:17,988 INFO L85 PathProgramCache]: Analyzing trace with hash 491239673, now seen corresponding path program 1 times [2024-11-07 09:50:17,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:50:17,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392075216] [2024-11-07 09:50:17,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:50:17,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:50:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:20,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:50:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:20,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:50:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:20,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 09:50:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:20,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:50:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:20,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 09:50:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:20,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:50:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:20,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 09:50:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:20,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:50:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:20,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 09:50:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:20,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:50:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:20,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 09:50:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:20,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:50:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:20,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:50:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:20,288 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 09:50:20,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:50:20,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392075216] [2024-11-07 09:50:20,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392075216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:50:20,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:50:20,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 09:50:20,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281930624] [2024-11-07 09:50:20,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:50:20,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 09:50:20,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:50:20,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 09:50:20,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-07 09:50:20,290 INFO L87 Difference]: Start difference. First operand 358 states and 508 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:50:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:50:22,599 INFO L93 Difference]: Finished difference Result 841 states and 1200 transitions. [2024-11-07 09:50:22,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 09:50:22,600 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2024-11-07 09:50:22,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:50:22,603 INFO L225 Difference]: With dead ends: 841 [2024-11-07 09:50:22,604 INFO L226 Difference]: Without dead ends: 625 [2024-11-07 09:50:22,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2024-11-07 09:50:22,607 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 371 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 09:50:22,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 428 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 09:50:22,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-11-07 09:50:22,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 441. [2024-11-07 09:50:22,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 396 states have (on average 1.3914141414141414) internal successors, (551), 396 states have internal predecessors, (551), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 09:50:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 629 transitions. [2024-11-07 09:50:22,637 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 629 transitions. Word has length 97 [2024-11-07 09:50:22,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:50:22,638 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 629 transitions. [2024-11-07 09:50:22,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:50:22,638 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 629 transitions. [2024-11-07 09:50:22,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 09:50:22,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:50:22,639 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:50:22,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 09:50:22,640 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:50:22,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:50:22,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1171298043, now seen corresponding path program 1 times [2024-11-07 09:50:22,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:50:22,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633556428] [2024-11-07 09:50:22,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:50:22,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:50:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:27,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:50:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:27,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:50:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:27,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 09:50:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:27,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:50:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:27,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 09:50:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:27,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:50:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:27,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 09:50:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:27,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:50:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:27,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 09:50:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:27,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:50:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:27,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 09:50:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:27,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:50:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:27,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:50:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 09:50:27,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:50:27,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633556428] [2024-11-07 09:50:27,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633556428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:50:27,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:50:27,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 09:50:27,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406376317] [2024-11-07 09:50:27,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:50:27,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 09:50:27,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:50:27,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 09:50:27,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-07 09:50:27,855 INFO L87 Difference]: Start difference. First operand 441 states and 629 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 09:50:29,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:50:29,903 INFO L93 Difference]: Finished difference Result 832 states and 1170 transitions. [2024-11-07 09:50:29,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 09:50:29,904 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 97 [2024-11-07 09:50:29,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:50:29,907 INFO L225 Difference]: With dead ends: 832 [2024-11-07 09:50:29,907 INFO L226 Difference]: Without dead ends: 543 [2024-11-07 09:50:29,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2024-11-07 09:50:29,908 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 272 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:50:29,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 757 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 09:50:29,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-07 09:50:29,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 441. [2024-11-07 09:50:29,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 396 states have (on average 1.3888888888888888) internal successors, (550), 396 states have internal predecessors, (550), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 09:50:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 628 transitions. [2024-11-07 09:50:29,938 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 628 transitions. Word has length 97 [2024-11-07 09:50:29,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:50:29,938 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 628 transitions. [2024-11-07 09:50:29,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 09:50:29,938 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 628 transitions. [2024-11-07 09:50:29,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 09:50:29,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:50:29,940 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:50:29,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 09:50:29,940 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:50:29,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:50:29,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1743707403, now seen corresponding path program 1 times [2024-11-07 09:50:29,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:50:29,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200819269] [2024-11-07 09:50:29,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:50:29,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:50:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:37,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:50:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:37,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:50:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:37,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 09:50:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:37,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:50:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:37,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 09:50:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:37,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:50:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:37,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 09:50:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:37,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:50:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:37,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 09:50:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:37,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:50:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:37,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 09:50:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:37,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:50:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:37,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:50:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 09:50:37,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:50:37,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200819269] [2024-11-07 09:50:37,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200819269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:50:37,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:50:37,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 09:50:37,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695855375] [2024-11-07 09:50:37,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:50:37,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 09:50:37,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:50:37,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 09:50:37,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-07 09:50:37,094 INFO L87 Difference]: Start difference. First operand 441 states and 628 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:50:39,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:50:39,396 INFO L93 Difference]: Finished difference Result 785 states and 1112 transitions. [2024-11-07 09:50:39,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 09:50:39,397 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2024-11-07 09:50:39,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:50:39,400 INFO L225 Difference]: With dead ends: 785 [2024-11-07 09:50:39,400 INFO L226 Difference]: Without dead ends: 557 [2024-11-07 09:50:39,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=246, Invalid=746, Unknown=0, NotChecked=0, Total=992 [2024-11-07 09:50:39,402 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 356 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:50:39,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 531 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 09:50:39,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-07 09:50:39,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 421. [2024-11-07 09:50:39,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 376 states have (on average 1.3936170212765957) internal successors, (524), 376 states have internal predecessors, (524), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 09:50:39,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 602 transitions. [2024-11-07 09:50:39,433 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 602 transitions. Word has length 98 [2024-11-07 09:50:39,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:50:39,435 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 602 transitions. [2024-11-07 09:50:39,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:50:39,435 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 602 transitions. [2024-11-07 09:50:39,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 09:50:39,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:50:39,437 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:50:39,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 09:50:39,437 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:50:39,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:50:39,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1063649033, now seen corresponding path program 1 times [2024-11-07 09:50:39,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:50:39,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166878996] [2024-11-07 09:50:39,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:50:39,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:50:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:41,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:50:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:41,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:50:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:41,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 09:50:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:41,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:50:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:41,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 09:50:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:41,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:50:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:41,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 09:50:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:41,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:50:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:41,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 09:50:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:41,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:50:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:41,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 09:50:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:41,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:50:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:41,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:50:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:41,221 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 09:50:41,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:50:41,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166878996] [2024-11-07 09:50:41,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166878996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:50:41,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:50:41,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 09:50:41,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688056387] [2024-11-07 09:50:41,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:50:41,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 09:50:41,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:50:41,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 09:50:41,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 09:50:41,223 INFO L87 Difference]: Start difference. First operand 421 states and 602 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:50:41,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:50:41,952 INFO L93 Difference]: Finished difference Result 717 states and 1016 transitions. [2024-11-07 09:50:41,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 09:50:41,952 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2024-11-07 09:50:41,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:50:41,955 INFO L225 Difference]: With dead ends: 717 [2024-11-07 09:50:41,955 INFO L226 Difference]: Without dead ends: 485 [2024-11-07 09:50:41,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-07 09:50:41,956 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 232 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 09:50:41,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 338 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 09:50:41,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-07 09:50:41,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 411. [2024-11-07 09:50:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 366 states have (on average 1.3934426229508197) internal successors, (510), 366 states have internal predecessors, (510), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 09:50:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 588 transitions. [2024-11-07 09:50:41,986 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 588 transitions. Word has length 98 [2024-11-07 09:50:41,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:50:41,986 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 588 transitions. [2024-11-07 09:50:41,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:50:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 588 transitions. [2024-11-07 09:50:41,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 09:50:41,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:50:41,987 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:50:41,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 09:50:41,988 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:50:41,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:50:41,988 INFO L85 PathProgramCache]: Analyzing trace with hash -448582361, now seen corresponding path program 1 times [2024-11-07 09:50:41,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:50:41,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327913149] [2024-11-07 09:50:41,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:50:41,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:50:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:44,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:50:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:44,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:50:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:44,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 09:50:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:44,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:50:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:44,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 09:50:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:44,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:50:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:44,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 09:50:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:44,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:50:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:44,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 09:50:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:44,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:50:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:44,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 09:50:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:44,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:50:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:44,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:50:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:44,911 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 09:50:44,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:50:44,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327913149] [2024-11-07 09:50:44,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327913149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:50:44,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:50:44,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 09:50:44,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711929908] [2024-11-07 09:50:44,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:50:44,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 09:50:44,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:50:44,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 09:50:44,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-07 09:50:44,913 INFO L87 Difference]: Start difference. First operand 411 states and 588 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:50:48,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:50:48,554 INFO L93 Difference]: Finished difference Result 922 states and 1314 transitions. [2024-11-07 09:50:48,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 09:50:48,555 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2024-11-07 09:50:48,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:50:48,557 INFO L225 Difference]: With dead ends: 922 [2024-11-07 09:50:48,558 INFO L226 Difference]: Without dead ends: 704 [2024-11-07 09:50:48,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2024-11-07 09:50:48,560 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 509 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 09:50:48,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 394 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 09:50:48,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2024-11-07 09:50:48,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 427. [2024-11-07 09:50:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 382 states have (on average 1.387434554973822) internal successors, (530), 382 states have internal predecessors, (530), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 09:50:48,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 608 transitions. [2024-11-07 09:50:48,593 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 608 transitions. Word has length 98 [2024-11-07 09:50:48,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:50:48,593 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 608 transitions. [2024-11-07 09:50:48,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:50:48,594 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 608 transitions. [2024-11-07 09:50:48,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 09:50:48,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:50:48,596 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:50:48,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 09:50:48,596 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:50:48,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:50:48,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1326425001, now seen corresponding path program 1 times [2024-11-07 09:50:48,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:50:48,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523917443] [2024-11-07 09:50:48,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:50:48,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:50:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:51,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:50:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:51,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:50:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:51,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 09:50:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:51,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:50:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:51,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 09:50:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:51,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:50:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:51,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 09:50:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:51,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:50:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:51,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 09:50:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:51,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:50:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:51,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 09:50:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:51,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:50:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:51,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:50:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:50:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 09:50:51,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:50:51,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523917443] [2024-11-07 09:50:51,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523917443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:50:51,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:50:51,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 09:50:51,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128188228] [2024-11-07 09:50:51,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:50:51,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 09:50:51,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:50:51,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 09:50:51,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-07 09:50:51,425 INFO L87 Difference]: Start difference. First operand 427 states and 608 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)