./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-86.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-86.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', '593a0fd2d509817879488fa887cd4b7fba333f845843eb4bb92d87213a868eae'] 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-86.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 593a0fd2d509817879488fa887cd4b7fba333f845843eb4bb92d87213a868eae --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:56:13,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:56:13,329 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:56:13,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:56:13,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:56:13,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:56:13,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:56:13,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:56:13,369 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:56:13,369 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:56:13,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:56:13,370 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:56:13,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:56:13,370 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:56:13,370 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:56:13,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:56:13,370 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:56:13,370 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:56:13,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 09:56:13,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:56:13,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:56:13,371 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:56:13,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:56:13,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:56:13,371 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:56:13,371 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:56:13,371 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:56:13,373 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:56:13,373 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:56:13,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:56:13,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:56:13,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:56:13,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:56:13,373 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:56:13,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:56:13,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:56:13,374 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 09:56:13,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 09:56:13,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:56:13,374 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:56:13,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:56:13,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:56:13,374 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 -> 593a0fd2d509817879488fa887cd4b7fba333f845843eb4bb92d87213a868eae [2024-11-07 09:56:13,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:56:13,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:56:13,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:56:13,673 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:56:13,674 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:56:13,675 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-86.i [2024-11-07 09:56:15,027 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:56:15,251 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:56:15,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-86.i [2024-11-07 09:56:15,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a11c322b2/fbcb3f0e9b8f4a178a8632c791820216/FLAGe3b0b3adf [2024-11-07 09:56:15,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a11c322b2/fbcb3f0e9b8f4a178a8632c791820216 [2024-11-07 09:56:15,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:56:15,279 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:56:15,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:56:15,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:56:15,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:56:15,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:56:15" (1/1) ... [2024-11-07 09:56:15,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@858a1ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:56:15, skipping insertion in model container [2024-11-07 09:56:15,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:56:15" (1/1) ... [2024-11-07 09:56:15,306 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:56:15,451 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-86.i[915,928] [2024-11-07 09:56:15,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:56:15,535 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:56:15,547 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-86.i[915,928] [2024-11-07 09:56:15,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:56:15,605 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:56:15,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:56:15 WrapperNode [2024-11-07 09:56:15,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:56:15,606 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:56:15,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:56:15,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:56:15,613 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:56:15" (1/1) ... [2024-11-07 09:56:15,625 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:56:15" (1/1) ... [2024-11-07 09:56:15,677 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2024-11-07 09:56:15,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:56:15,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:56:15,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:56:15,679 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:56:15,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:56:15" (1/1) ... [2024-11-07 09:56:15,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:56:15" (1/1) ... [2024-11-07 09:56:15,693 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:56:15" (1/1) ... [2024-11-07 09:56:15,726 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:56:15,727 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:56:15" (1/1) ... [2024-11-07 09:56:15,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:56:15" (1/1) ... [2024-11-07 09:56:15,734 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:56:15" (1/1) ... [2024-11-07 09:56:15,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:56:15" (1/1) ... [2024-11-07 09:56:15,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:56:15" (1/1) ... [2024-11-07 09:56:15,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:56:15" (1/1) ... [2024-11-07 09:56:15,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:56:15,755 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:56:15,755 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:56:15,755 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:56:15,756 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:56:15" (1/1) ... [2024-11-07 09:56:15,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:56:15,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:56:15,787 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:56:15,789 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:56:15,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:56:15,806 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:56:15,806 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:56:15,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 09:56:15,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:56:15,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:56:15,868 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:56:15,870 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:56:16,170 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-07 09:56:16,170 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:56:16,178 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:56:16,179 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:56:16,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:56:16 BoogieIcfgContainer [2024-11-07 09:56:16,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:56:16,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:56:16,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:56:16,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:56:16,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:56:15" (1/3) ... [2024-11-07 09:56:16,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27be499c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:56:16, skipping insertion in model container [2024-11-07 09:56:16,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:56:15" (2/3) ... [2024-11-07 09:56:16,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27be499c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:56:16, skipping insertion in model container [2024-11-07 09:56:16,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:56:16" (3/3) ... [2024-11-07 09:56:16,192 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-86.i [2024-11-07 09:56:16,204 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:56:16,204 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:56:16,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:56:16,284 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;@704fc905, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:56:16,284 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:56:16,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 09:56:16,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 09:56:16,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:56:16,302 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:16,302 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:56:16,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:56:16,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1873808516, now seen corresponding path program 1 times [2024-11-07 09:56:16,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:56:16,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137336889] [2024-11-07 09:56:16,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:56:16,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:56:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:16,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:56:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:16,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:56:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:16,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:56:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:16,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:56:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:16,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:56:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:16,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:56:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:16,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:56:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:16,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:56:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:16,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:56:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:16,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:56:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:16,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:56:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:16,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:56:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:16,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:56:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:16,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:56:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:16,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 09:56:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:16,581 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 09:56:16,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:56:16,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137336889] [2024-11-07 09:56:16,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137336889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:56:16,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:56:16,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:56:16,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287112907] [2024-11-07 09:56:16,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:56:16,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:56:16,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:56:16,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:56:16,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:56:16,612 INFO L87 Difference]: Start difference. First operand has 55 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 09:56:16,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:56:16,631 INFO L93 Difference]: Finished difference Result 103 states and 173 transitions. [2024-11-07 09:56:16,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:56:16,634 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2024-11-07 09:56:16,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:56:16,640 INFO L225 Difference]: With dead ends: 103 [2024-11-07 09:56:16,640 INFO L226 Difference]: Without dead ends: 51 [2024-11-07 09:56:16,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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:56:16,647 INFO L432 NwaCegarLoop]: 75 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, 75 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:56:16,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:56:16,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-07 09:56:16,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-07 09:56:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 09:56:16,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2024-11-07 09:56:16,688 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 101 [2024-11-07 09:56:16,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:56:16,689 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2024-11-07 09:56:16,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 09:56:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2024-11-07 09:56:16,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 09:56:16,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:56:16,692 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:16,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 09:56:16,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:56:16,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:56:16,693 INFO L85 PathProgramCache]: Analyzing trace with hash 715629638, now seen corresponding path program 1 times [2024-11-07 09:56:16,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:56:16,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283579265] [2024-11-07 09:56:16,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:56:16,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:56:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:17,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:56:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:17,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:56:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:17,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:56:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:17,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:56:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:17,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:56:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:17,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:56:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:17,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:56:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:17,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:56:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:17,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:56:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:17,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:56:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:17,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:56:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:17,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:56:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:17,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:56:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:17,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:56:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:17,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 09:56:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:17,258 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 09:56:17,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:56:17,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283579265] [2024-11-07 09:56:17,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283579265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:56:17,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:56:17,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 09:56:17,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203965440] [2024-11-07 09:56:17,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:56:17,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 09:56:17,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:56:17,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 09:56:17,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 09:56:17,265 INFO L87 Difference]: Start difference. First operand 51 states and 75 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 09:56:17,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:56:17,518 INFO L93 Difference]: Finished difference Result 148 states and 220 transitions. [2024-11-07 09:56:17,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 09:56:17,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-07 09:56:17,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:56:17,522 INFO L225 Difference]: With dead ends: 148 [2024-11-07 09:56:17,522 INFO L226 Difference]: Without dead ends: 100 [2024-11-07 09:56:17,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 09:56:17,526 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 99 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 09:56:17,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 237 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 09:56:17,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-07 09:56:17,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 84. [2024-11-07 09:56:17,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 51 states have internal predecessors, (65), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 09:56:17,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 125 transitions. [2024-11-07 09:56:17,556 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 125 transitions. Word has length 101 [2024-11-07 09:56:17,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:56:17,556 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 125 transitions. [2024-11-07 09:56:17,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 09:56:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 125 transitions. [2024-11-07 09:56:17,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 09:56:17,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:56:17,557 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:17,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 09:56:17,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:56:17,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:56:17,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1416694216, now seen corresponding path program 1 times [2024-11-07 09:56:17,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:56:17,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13426158] [2024-11-07 09:56:17,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:56:17,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:56:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:23,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:56:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:23,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:56:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:23,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:56:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:23,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:56:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:23,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:56:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:23,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:56:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:23,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:56:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:23,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:56:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:23,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:56:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:23,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:56:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:23,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:56:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:23,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:56:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:23,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:56:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:23,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:56:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:23,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 09:56:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 09:56:23,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:56:23,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13426158] [2024-11-07 09:56:23,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13426158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:56:23,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:56:23,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 09:56:23,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675518811] [2024-11-07 09:56:23,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:56:23,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 09:56:23,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:56:23,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 09:56:23,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-07 09:56:23,724 INFO L87 Difference]: Start difference. First operand 84 states and 125 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 09:56:24,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:56:24,858 INFO L93 Difference]: Finished difference Result 213 states and 306 transitions. [2024-11-07 09:56:24,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 09:56:24,860 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-07 09:56:24,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:56:24,862 INFO L225 Difference]: With dead ends: 213 [2024-11-07 09:56:24,862 INFO L226 Difference]: Without dead ends: 162 [2024-11-07 09:56:24,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2024-11-07 09:56:24,863 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 282 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 09:56:24,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 446 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 09:56:24,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-07 09:56:24,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 100. [2024-11-07 09:56:24,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 67 states have internal predecessors, (85), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 09:56:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2024-11-07 09:56:24,889 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 101 [2024-11-07 09:56:24,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:56:24,889 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2024-11-07 09:56:24,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 09:56:24,890 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2024-11-07 09:56:24,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 09:56:24,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:56:24,894 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:24,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 09:56:24,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:56:24,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:56:24,895 INFO L85 PathProgramCache]: Analyzing trace with hash 829888202, now seen corresponding path program 1 times [2024-11-07 09:56:24,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:56:24,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233714907] [2024-11-07 09:56:24,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:56:24,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:56:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:24,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:56:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:24,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:56:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:24,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:56:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:24,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:56:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:24,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:56:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:24,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:56:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:24,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:56:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:24,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:56:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:24,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:56:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:24,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:56:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:25,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:56:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:25,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:56:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:25,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:56:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:25,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:56:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:25,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 09:56:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:25,020 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 09:56:25,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:56:25,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233714907] [2024-11-07 09:56:25,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233714907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:56:25,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:56:25,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 09:56:25,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534057587] [2024-11-07 09:56:25,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:56:25,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 09:56:25,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:56:25,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 09:56:25,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:56:25,022 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 09:56:25,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:56:25,065 INFO L93 Difference]: Finished difference Result 197 states and 289 transitions. [2024-11-07 09:56:25,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 09:56:25,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-07 09:56:25,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:56:25,067 INFO L225 Difference]: With dead ends: 197 [2024-11-07 09:56:25,070 INFO L226 Difference]: Without dead ends: 147 [2024-11-07 09:56:25,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:56:25,071 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 65 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:56:25,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 152 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:56:25,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-07 09:56:25,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2024-11-07 09:56:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 96 states have (on average 1.25) internal successors, (120), 96 states have internal predecessors, (120), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 09:56:25,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 210 transitions. [2024-11-07 09:56:25,099 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 210 transitions. Word has length 101 [2024-11-07 09:56:25,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:56:25,099 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 210 transitions. [2024-11-07 09:56:25,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 09:56:25,099 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 210 transitions. [2024-11-07 09:56:25,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 09:56:25,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:56:25,101 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:25,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 09:56:25,101 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:56:25,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:56:25,104 INFO L85 PathProgramCache]: Analyzing trace with hash 809192120, now seen corresponding path program 1 times [2024-11-07 09:56:25,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:56:25,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735602950] [2024-11-07 09:56:25,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:56:25,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:56:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:25,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:56:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:25,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:56:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:25,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:56:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:25,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:56:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:25,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:56:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:25,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:56:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:25,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:56:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:25,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:56:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:25,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:56:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:25,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:56:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:25,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:56:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:25,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:56:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:25,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:56:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:25,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:56:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:25,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 09:56:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:25,385 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 09:56:25,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:56:25,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735602950] [2024-11-07 09:56:25,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735602950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:56:25,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:56:25,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 09:56:25,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023759973] [2024-11-07 09:56:25,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:56:25,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 09:56:25,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:56:25,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 09:56:25,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 09:56:25,389 INFO L87 Difference]: Start difference. First operand 145 states and 210 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 09:56:25,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:56:25,435 INFO L93 Difference]: Finished difference Result 250 states and 364 transitions. [2024-11-07 09:56:25,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 09:56:25,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-07 09:56:25,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:56:25,437 INFO L225 Difference]: With dead ends: 250 [2024-11-07 09:56:25,437 INFO L226 Difference]: Without dead ends: 154 [2024-11-07 09:56:25,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 09:56:25,438 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:56:25,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 197 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:56:25,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-07 09:56:25,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 145. [2024-11-07 09:56:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 96 states have (on average 1.21875) internal successors, (117), 96 states have internal predecessors, (117), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 09:56:25,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 207 transitions. [2024-11-07 09:56:25,466 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 207 transitions. Word has length 102 [2024-11-07 09:56:25,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:56:25,467 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 207 transitions. [2024-11-07 09:56:25,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 09:56:25,468 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 207 transitions. [2024-11-07 09:56:25,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 09:56:25,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:56:25,470 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:25,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 09:56:25,471 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:56:25,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:56:25,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1710767814, now seen corresponding path program 1 times [2024-11-07 09:56:25,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:56:25,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77661094] [2024-11-07 09:56:25,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:56:25,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:56:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:29,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:56:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:29,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:56:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:29,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:56:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:29,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:56:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:29,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:56:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:29,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:56:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:29,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:56:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:29,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:56:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:29,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:56:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:29,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:56:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:29,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:56:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:29,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:56:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:29,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:56:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:29,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:56:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:29,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 09:56:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:29,830 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 09:56:29,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:56:29,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77661094] [2024-11-07 09:56:29,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77661094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:56:29,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:56:29,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 09:56:29,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304604543] [2024-11-07 09:56:29,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:56:29,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 09:56:29,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:56:29,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 09:56:29,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-07 09:56:29,834 INFO L87 Difference]: Start difference. First operand 145 states and 207 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 09:56:31,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:56:31,341 INFO L93 Difference]: Finished difference Result 203 states and 271 transitions. [2024-11-07 09:56:31,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 09:56:31,341 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-07 09:56:31,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:56:31,343 INFO L225 Difference]: With dead ends: 203 [2024-11-07 09:56:31,343 INFO L226 Difference]: Without dead ends: 201 [2024-11-07 09:56:31,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2024-11-07 09:56:31,344 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 188 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 09:56:31,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 505 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 09:56:31,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-07 09:56:31,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 143. [2024-11-07 09:56:31,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 94 states have (on average 1.2127659574468086) internal successors, (114), 94 states have internal predecessors, (114), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 09:56:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 204 transitions. [2024-11-07 09:56:31,373 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 204 transitions. Word has length 102 [2024-11-07 09:56:31,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:56:31,375 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 204 transitions. [2024-11-07 09:56:31,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 09:56:31,375 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 204 transitions. [2024-11-07 09:56:31,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 09:56:31,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:56:31,376 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:31,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 09:56:31,376 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:56:31,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:56:31,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1021349534, now seen corresponding path program 1 times [2024-11-07 09:56:31,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:56:31,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414868332] [2024-11-07 09:56:31,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:56:31,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:56:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:34,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:56:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:34,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:56:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:35,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:56:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:35,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:56:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:35,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:56:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:35,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:56:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:35,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:56:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:35,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:56:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:35,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:56:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:35,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:56:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:35,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:56:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:35,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:56:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:35,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:56:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:35,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:56:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:35,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 09:56:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:35,054 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 09:56:35,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:56:35,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414868332] [2024-11-07 09:56:35,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414868332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:56:35,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:56:35,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 09:56:35,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582981915] [2024-11-07 09:56:35,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:56:35,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 09:56:35,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:56:35,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 09:56:35,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-07 09:56:35,056 INFO L87 Difference]: Start difference. First operand 143 states and 204 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 09:56:36,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:56:36,093 INFO L93 Difference]: Finished difference Result 199 states and 267 transitions. [2024-11-07 09:56:36,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 09:56:36,094 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-07 09:56:36,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:56:36,095 INFO L225 Difference]: With dead ends: 199 [2024-11-07 09:56:36,095 INFO L226 Difference]: Without dead ends: 197 [2024-11-07 09:56:36,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2024-11-07 09:56:36,097 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 182 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 09:56:36,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 414 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 09:56:36,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-07 09:56:36,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 146. [2024-11-07 09:56:36,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 97 states have (on average 1.2164948453608246) internal successors, (118), 97 states have internal predecessors, (118), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 09:56:36,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 208 transitions. [2024-11-07 09:56:36,134 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 208 transitions. Word has length 102 [2024-11-07 09:56:36,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:56:36,135 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 208 transitions. [2024-11-07 09:56:36,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 09:56:36,135 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 208 transitions. [2024-11-07 09:56:36,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 09:56:36,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:56:36,136 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:36,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 09:56:36,136 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:56:36,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:56:36,137 INFO L85 PathProgramCache]: Analyzing trace with hash 870794071, now seen corresponding path program 1 times [2024-11-07 09:56:36,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:56:36,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478536869] [2024-11-07 09:56:36,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:56:36,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:56:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:41,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:56:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:41,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:56:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:41,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:56:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:41,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:56:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:41,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:56:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:41,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:56:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:41,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:56:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:41,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:56:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:41,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:56:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:41,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:56:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:41,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:56:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:41,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:56:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:41,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:56:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:41,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:56:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:41,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 09:56:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:41,657 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 09:56:41,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:56:41,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478536869] [2024-11-07 09:56:41,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478536869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:56:41,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:56:41,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 09:56:41,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388969079] [2024-11-07 09:56:41,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:56:41,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 09:56:41,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:56:41,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 09:56:41,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-11-07 09:56:41,659 INFO L87 Difference]: Start difference. First operand 146 states and 208 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 09:56:46,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:56:46,572 INFO L93 Difference]: Finished difference Result 217 states and 288 transitions. [2024-11-07 09:56:46,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 09:56:46,572 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-07 09:56:46,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:56:46,574 INFO L225 Difference]: With dead ends: 217 [2024-11-07 09:56:46,574 INFO L226 Difference]: Without dead ends: 215 [2024-11-07 09:56:46,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2024-11-07 09:56:46,575 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 199 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 09:56:46,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 494 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 09:56:46,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-07 09:56:46,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 158. [2024-11-07 09:56:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 109 states have internal predecessors, (133), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 09:56:46,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 223 transitions. [2024-11-07 09:56:46,593 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 223 transitions. Word has length 102 [2024-11-07 09:56:46,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:56:46,594 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 223 transitions. [2024-11-07 09:56:46,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 09:56:46,595 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 223 transitions. [2024-11-07 09:56:46,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 09:56:46,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:56:46,596 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:46,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 09:56:46,596 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:56:46,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:56:46,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1550852441, now seen corresponding path program 1 times [2024-11-07 09:56:46,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:56:46,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938458007] [2024-11-07 09:56:46,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:56:46,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:56:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:52,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:56:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:52,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:56:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:52,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:56:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:52,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:56:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:52,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:56:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:52,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:56:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:52,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:56:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:52,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:56:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:52,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:56:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:52,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:56:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:52,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:56:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:52,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:56:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:52,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:56:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:52,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:56:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:52,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 09:56:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:56:52,961 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 09:56:52,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:56:52,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938458007] [2024-11-07 09:56:52,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938458007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:56:52,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:56:52,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 09:56:52,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244806359] [2024-11-07 09:56:52,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:56:52,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 09:56:52,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:56:52,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 09:56:52,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-11-07 09:56:52,964 INFO L87 Difference]: Start difference. First operand 158 states and 223 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 09:56:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:56:59,911 INFO L93 Difference]: Finished difference Result 211 states and 282 transitions. [2024-11-07 09:56:59,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 09:56:59,912 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-07 09:56:59,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:56:59,914 INFO L225 Difference]: With dead ends: 211 [2024-11-07 09:56:59,914 INFO L226 Difference]: Without dead ends: 209 [2024-11-07 09:56:59,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=271, Invalid=659, Unknown=0, NotChecked=0, Total=930 [2024-11-07 09:56:59,915 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 165 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 09:56:59,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 457 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 09:56:59,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-07 09:56:59,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 158. [2024-11-07 09:56:59,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 109 states have internal predecessors, (133), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 09:56:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 223 transitions. [2024-11-07 09:56:59,934 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 223 transitions. Word has length 102 [2024-11-07 09:56:59,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:56:59,935 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 223 transitions. [2024-11-07 09:56:59,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 09:56:59,935 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 223 transitions. [2024-11-07 09:56:59,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 09:56:59,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:56:59,936 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:59,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 09:56:59,937 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:56:59,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:56:59,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1440692884, now seen corresponding path program 1 times [2024-11-07 09:56:59,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:56:59,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046019040] [2024-11-07 09:56:59,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:56:59,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:56:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:02,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:57:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:02,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:57:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:02,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:57:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:02,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:57:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:02,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:57:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:02,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:57:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:02,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:57:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:02,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:57:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:02,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:57:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:02,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:57:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:02,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:57:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:02,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:57:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:02,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:57:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:02,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:57:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:02,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 09:57:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:02,868 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 09:57:02,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:57:02,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046019040] [2024-11-07 09:57:02,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046019040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:57:02,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:57:02,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 09:57:02,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735291459] [2024-11-07 09:57:02,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:57:02,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 09:57:02,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:57:02,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 09:57:02,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-11-07 09:57:02,870 INFO L87 Difference]: Start difference. First operand 158 states and 223 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 09:57:03,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:57:03,524 INFO L93 Difference]: Finished difference Result 199 states and 268 transitions. [2024-11-07 09:57:03,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 09:57:03,525 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-11-07 09:57:03,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:57:03,526 INFO L225 Difference]: With dead ends: 199 [2024-11-07 09:57:03,526 INFO L226 Difference]: Without dead ends: 197 [2024-11-07 09:57:03,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2024-11-07 09:57:03,527 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 135 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 09:57:03,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 409 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 09:57:03,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-07 09:57:03,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 155. [2024-11-07 09:57:03,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 106 states have (on average 1.2169811320754718) internal successors, (129), 106 states have internal predecessors, (129), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 09:57:03,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 219 transitions. [2024-11-07 09:57:03,541 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 219 transitions. Word has length 103 [2024-11-07 09:57:03,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:57:03,541 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 219 transitions. [2024-11-07 09:57:03,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 09:57:03,541 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 219 transitions. [2024-11-07 09:57:03,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 09:57:03,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:57:03,543 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:03,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 09:57:03,544 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:57:03,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:57:03,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1453803125, now seen corresponding path program 1 times [2024-11-07 09:57:03,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:57:03,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735536615] [2024-11-07 09:57:03,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:57:03,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:57:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:08,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:57:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:08,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:57:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:08,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:57:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:08,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:57:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:08,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:57:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:08,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:57:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:08,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:57:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:08,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:57:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:08,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:57:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:08,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:57:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:08,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:57:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:08,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:57:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:08,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:57:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:08,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:57:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:08,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 09:57:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:08,634 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 09:57:08,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:57:08,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735536615] [2024-11-07 09:57:08,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735536615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:57:08,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:57:08,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 09:57:08,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620197501] [2024-11-07 09:57:08,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:57:08,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 09:57:08,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:57:08,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 09:57:08,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-07 09:57:08,637 INFO L87 Difference]: Start difference. First operand 155 states and 219 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 09:57:13,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:57:13,892 INFO L93 Difference]: Finished difference Result 217 states and 288 transitions. [2024-11-07 09:57:13,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 09:57:13,893 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 103 [2024-11-07 09:57:13,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:57:13,894 INFO L225 Difference]: With dead ends: 217 [2024-11-07 09:57:13,894 INFO L226 Difference]: Without dead ends: 215 [2024-11-07 09:57:13,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2024-11-07 09:57:13,896 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 205 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 09:57:13,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 378 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 09:57:13,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-07 09:57:13,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 158. [2024-11-07 09:57:13,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 109 states have internal predecessors, (133), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 09:57:13,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 223 transitions. [2024-11-07 09:57:13,916 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 223 transitions. Word has length 103 [2024-11-07 09:57:13,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:57:13,916 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 223 transitions. [2024-11-07 09:57:13,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 09:57:13,917 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 223 transitions. [2024-11-07 09:57:13,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 09:57:13,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:57:13,918 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:13,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 09:57:13,918 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:57:13,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:57:13,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1280161265, now seen corresponding path program 1 times [2024-11-07 09:57:13,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:57:13,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144029203] [2024-11-07 09:57:13,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:57:13,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:57:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:19,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:57:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:19,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:57:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:19,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:57:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:19,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:57:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:19,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:57:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:19,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:57:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:19,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:57:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:19,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:57:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:19,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:57:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:19,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:57:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:19,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:57:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:19,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:57:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:19,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:57:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:19,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:57:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:19,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 09:57:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 09:57:19,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:57:19,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144029203] [2024-11-07 09:57:19,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144029203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:57:19,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:57:19,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-07 09:57:19,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750954027] [2024-11-07 09:57:19,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:57:19,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 09:57:19,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:57:19,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 09:57:19,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-11-07 09:57:19,399 INFO L87 Difference]: Start difference. First operand 158 states and 223 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 09:57:23,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:57:23,261 INFO L93 Difference]: Finished difference Result 215 states and 286 transitions. [2024-11-07 09:57:23,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 09:57:23,262 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-11-07 09:57:23,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:57:23,264 INFO L225 Difference]: With dead ends: 215 [2024-11-07 09:57:23,264 INFO L226 Difference]: Without dead ends: 213 [2024-11-07 09:57:23,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=279, Invalid=843, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 09:57:23,265 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 256 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 09:57:23,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 438 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 09:57:23,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-07 09:57:23,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 161. [2024-11-07 09:57:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 112 states have (on average 1.2232142857142858) internal successors, (137), 112 states have internal predecessors, (137), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 09:57:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 227 transitions. [2024-11-07 09:57:23,279 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 227 transitions. Word has length 103 [2024-11-07 09:57:23,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:57:23,279 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 227 transitions. [2024-11-07 09:57:23,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 09:57:23,279 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 227 transitions. [2024-11-07 09:57:23,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 09:57:23,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:57:23,280 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:23,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 09:57:23,281 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:57:23,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:57:23,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1846830135, now seen corresponding path program 1 times [2024-11-07 09:57:23,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:57:23,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785227025] [2024-11-07 09:57:23,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:57:23,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:57:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:27,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:57:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:27,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:57:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:27,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:57:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:27,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:57:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:27,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:57:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:27,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:57:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:27,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:57:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:27,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:57:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:27,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:57:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:27,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:57:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:27,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:57:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:27,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:57:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:27,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:57:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:27,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:57:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:27,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 09:57:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:57:27,515 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 09:57:27,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:57:27,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785227025] [2024-11-07 09:57:27,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785227025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:57:27,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:57:27,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 09:57:27,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202263916] [2024-11-07 09:57:27,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:57:27,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 09:57:27,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:57:27,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 09:57:27,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-07 09:57:27,518 INFO L87 Difference]: Start difference. First operand 161 states and 227 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 09:57:31,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:57:31,910 INFO L93 Difference]: Finished difference Result 215 states and 286 transitions. [2024-11-07 09:57:31,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 09:57:31,910 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-11-07 09:57:31,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:57:31,912 INFO L225 Difference]: With dead ends: 215 [2024-11-07 09:57:31,912 INFO L226 Difference]: Without dead ends: 213 [2024-11-07 09:57:31,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=289, Invalid=901, Unknown=0, NotChecked=0, Total=1190 [2024-11-07 09:57:31,913 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 189 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 09:57:31,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 394 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 09:57:31,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-07 09:57:31,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 161. [2024-11-07 09:57:31,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 112 states have (on average 1.2232142857142858) internal successors, (137), 112 states have internal predecessors, (137), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 09:57:31,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 227 transitions. [2024-11-07 09:57:31,929 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 227 transitions. Word has length 103 [2024-11-07 09:57:31,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:57:31,929 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 227 transitions. [2024-11-07 09:57:31,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 09:57:31,931 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 227 transitions. [2024-11-07 09:57:31,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 09:57:31,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:57:31,932 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:31,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 09:57:31,933 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:57:31,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:57:31,933 INFO L85 PathProgramCache]: Analyzing trace with hash 887134255, now seen corresponding path program 1 times [2024-11-07 09:57:31,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:57:31,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404765936] [2024-11-07 09:57:31,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:57:31,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:57:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat