./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.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_fillercode_fillercodesize_ps-cn-10_file-10.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', '17124c627a77300cd44285b9c4c316438e4d73c0a011ab8330c0a1114bb82733'] 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_fillercode_fillercodesize_ps-cn-10_file-10.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 17124c627a77300cd44285b9c4c316438e4d73c0a011ab8330c0a1114bb82733 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:50:57,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:50:57,606 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 04:50:57,613 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:50:57,615 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:50:57,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:50:57,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:50:57,640 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:50:57,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:50:57,641 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:50:57,641 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:50:57,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:50:57,642 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:50:57,642 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:50:57,642 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:50:57,643 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:50:57,643 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:50:57,643 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:50:57,643 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:50:57,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:50:57,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:50:57,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:50:57,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:50:57,644 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:50:57,644 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:50:57,644 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:50:57,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:50:57,644 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:50:57,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:50:57,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:50:57,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:50:57,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:50:57,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:50:57,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:50:57,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:50:57,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:50:57,645 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:50:57,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:50:57,645 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:50:57,645 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:50:57,645 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:50:57,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:50:57,646 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 -> 17124c627a77300cd44285b9c4c316438e4d73c0a011ab8330c0a1114bb82733 [2024-11-07 04:50:57,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:50:57,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:50:57,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:50:57,896 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:50:57,896 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:50:57,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.i [2024-11-07 04:50:59,049 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:50:59,240 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:50:59,241 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.i [2024-11-07 04:50:59,246 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95e94a891/f092c44d7aa04ad49c76df2e66b26809/FLAGf867f0892 [2024-11-07 04:50:59,612 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95e94a891/f092c44d7aa04ad49c76df2e66b26809 [2024-11-07 04:50:59,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:50:59,615 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:50:59,616 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:50:59,616 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:50:59,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:50:59,620 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:50:59" (1/1) ... [2024-11-07 04:50:59,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db15f72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:59, skipping insertion in model container [2024-11-07 04:50:59,621 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:50:59" (1/1) ... [2024-11-07 04:50:59,633 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:50:59,728 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_fillercode_fillercodesize_ps-cn-10_file-10.i[915,928] [2024-11-07 04:50:59,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:50:59,790 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:50:59,800 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_fillercode_fillercodesize_ps-cn-10_file-10.i[915,928] [2024-11-07 04:50:59,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:50:59,836 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:50:59,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:59 WrapperNode [2024-11-07 04:50:59,839 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:50:59,840 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:50:59,840 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:50:59,840 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:50:59,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:59" (1/1) ... [2024-11-07 04:50:59,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:59" (1/1) ... [2024-11-07 04:50:59,888 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 214 [2024-11-07 04:50:59,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:50:59,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:50:59,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:50:59,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:50:59,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:59" (1/1) ... [2024-11-07 04:50:59,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:59" (1/1) ... [2024-11-07 04:50:59,905 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:59" (1/1) ... [2024-11-07 04:50:59,927 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 04:50:59,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:59" (1/1) ... [2024-11-07 04:50:59,928 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:59" (1/1) ... [2024-11-07 04:50:59,936 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:59" (1/1) ... [2024-11-07 04:50:59,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:59" (1/1) ... [2024-11-07 04:50:59,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:59" (1/1) ... [2024-11-07 04:50:59,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:59" (1/1) ... [2024-11-07 04:50:59,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:50:59,955 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:50:59,955 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:50:59,955 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:50:59,956 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:59" (1/1) ... [2024-11-07 04:50:59,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:50:59,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:50:59,982 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 04:50:59,985 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 04:51:00,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:51:00,004 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:51:00,004 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:51:00,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:51:00,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:51:00,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:51:00,081 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:51:00,083 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:51:00,439 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-07 04:51:00,440 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:51:00,449 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:51:00,452 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:51:00,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:51:00 BoogieIcfgContainer [2024-11-07 04:51:00,453 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:51:00,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:51:00,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:51:00,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:51:00,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:50:59" (1/3) ... [2024-11-07 04:51:00,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9b2be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:51:00, skipping insertion in model container [2024-11-07 04:51:00,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:59" (2/3) ... [2024-11-07 04:51:00,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9b2be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:51:00, skipping insertion in model container [2024-11-07 04:51:00,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:51:00" (3/3) ... [2024-11-07 04:51:00,463 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-10.i [2024-11-07 04:51:00,473 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:51:00,474 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:51:00,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:51:00,527 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;@33511131, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:51:00,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:51:00,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 64 states have (on average 1.40625) internal successors, (90), 65 states have internal predecessors, (90), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 04:51:00,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-07 04:51:00,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:51:00,544 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:51:00,545 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:51:00,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:51:00,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2101394287, now seen corresponding path program 1 times [2024-11-07 04:51:00,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:51:00,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934333409] [2024-11-07 04:51:00,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:51:00,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:51:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:51:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:51:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:51:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:51:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:51:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:51:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:51:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:51:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:51:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:51:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:51:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:51:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:51:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:51:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:51:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:51:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:51:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:51:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:51:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:51:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:51:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 04:51:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:51:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 04:51:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:51:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:00,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 04:51:00,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:51:00,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934333409] [2024-11-07 04:51:00,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934333409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:51:00,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:51:00,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:51:00,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428570060] [2024-11-07 04:51:00,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:51:00,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:51:00,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:51:00,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:51:00,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:51:00,944 INFO L87 Difference]: Start difference. First operand has 92 states, 64 states have (on average 1.40625) internal successors, (90), 65 states have internal predecessors, (90), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 04:51:00,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:51:00,969 INFO L93 Difference]: Finished difference Result 177 states and 299 transitions. [2024-11-07 04:51:00,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:51:00,972 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 164 [2024-11-07 04:51:00,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:51:00,976 INFO L225 Difference]: With dead ends: 177 [2024-11-07 04:51:00,977 INFO L226 Difference]: Without dead ends: 88 [2024-11-07 04:51:00,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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 04:51:00,982 INFO L432 NwaCegarLoop]: 132 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, 132 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 04:51:00,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:51:00,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-07 04:51:01,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-07 04:51:01,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 61 states have internal predecessors, (82), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 04:51:01,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 132 transitions. [2024-11-07 04:51:01,019 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 132 transitions. Word has length 164 [2024-11-07 04:51:01,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:51:01,020 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 132 transitions. [2024-11-07 04:51:01,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 04:51:01,020 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 132 transitions. [2024-11-07 04:51:01,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 04:51:01,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:51:01,043 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:51:01,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:51:01,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:51:01,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:51:01,044 INFO L85 PathProgramCache]: Analyzing trace with hash -615042911, now seen corresponding path program 1 times [2024-11-07 04:51:01,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:51:01,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309722680] [2024-11-07 04:51:01,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:51:01,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:51:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:51:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:51:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:51:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:51:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:51:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:51:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:51:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:51:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:51:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:51:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:51:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:51:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:51:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:51:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:51:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:51:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:51:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:51:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:51:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:51:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:51:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 04:51:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:51:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 04:51:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:51:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:01,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 04:51:01,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:51:01,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309722680] [2024-11-07 04:51:01,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309722680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:51:01,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:51:01,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 04:51:01,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451191593] [2024-11-07 04:51:01,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:51:01,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 04:51:01,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:51:01,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 04:51:01,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:51:01,674 INFO L87 Difference]: Start difference. First operand 88 states and 132 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 04:51:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:51:01,880 INFO L93 Difference]: Finished difference Result 259 states and 391 transitions. [2024-11-07 04:51:01,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 04:51:01,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2024-11-07 04:51:01,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:51:01,883 INFO L225 Difference]: With dead ends: 259 [2024-11-07 04:51:01,883 INFO L226 Difference]: Without dead ends: 174 [2024-11-07 04:51:01,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:51:01,887 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 94 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 04:51:01,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 499 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 04:51:01,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-07 04:51:01,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 140. [2024-11-07 04:51:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 87 states have internal predecessors, (112), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-07 04:51:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 212 transitions. [2024-11-07 04:51:01,918 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 212 transitions. Word has length 165 [2024-11-07 04:51:01,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:51:01,919 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 212 transitions. [2024-11-07 04:51:01,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 04:51:01,919 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 212 transitions. [2024-11-07 04:51:01,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-07 04:51:01,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:51:01,921 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:51:01,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 04:51:01,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:51:01,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:51:01,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2087881671, now seen corresponding path program 1 times [2024-11-07 04:51:01,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:51:01,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092695331] [2024-11-07 04:51:01,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:51:01,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:51:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:51:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:51:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:51:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:51:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:51:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:51:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:51:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:51:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:51:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:51:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:51:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:51:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:51:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:51:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:51:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:51:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:51:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:51:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:51:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:51:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:51:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 04:51:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:51:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 04:51:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:51:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 04:51:02,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:51:02,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092695331] [2024-11-07 04:51:02,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092695331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:51:02,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:51:02,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 04:51:02,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546739649] [2024-11-07 04:51:02,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:51:02,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:51:02,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:51:02,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:51:02,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:51:02,277 INFO L87 Difference]: Start difference. First operand 140 states and 212 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 04:51:02,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:51:02,390 INFO L93 Difference]: Finished difference Result 237 states and 353 transitions. [2024-11-07 04:51:02,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:51:02,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 166 [2024-11-07 04:51:02,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:51:02,392 INFO L225 Difference]: With dead ends: 237 [2024-11-07 04:51:02,392 INFO L226 Difference]: Without dead ends: 150 [2024-11-07 04:51:02,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:51:02,396 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 112 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:51:02,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 224 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:51:02,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-07 04:51:02,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-07 04:51:02,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 95 states have (on average 1.263157894736842) internal successors, (120), 95 states have internal predecessors, (120), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-07 04:51:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 220 transitions. [2024-11-07 04:51:02,421 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 220 transitions. Word has length 166 [2024-11-07 04:51:02,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:51:02,421 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 220 transitions. [2024-11-07 04:51:02,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 04:51:02,423 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 220 transitions. [2024-11-07 04:51:02,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 04:51:02,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:51:02,438 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:51:02,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 04:51:02,438 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:51:02,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:51:02,438 INFO L85 PathProgramCache]: Analyzing trace with hash 228644080, now seen corresponding path program 1 times [2024-11-07 04:51:02,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:51:02,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970473951] [2024-11-07 04:51:02,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:51:02,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:51:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:51:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:51:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:51:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:51:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:51:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:51:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:51:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:51:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:51:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:51:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:51:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:51:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:51:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:51:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:51:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:51:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:51:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:51:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:51:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:51:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:51:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 04:51:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:51:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 04:51:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:51:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 04:51:02,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:51:02,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970473951] [2024-11-07 04:51:02,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970473951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:51:02,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:51:02,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 04:51:02,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063445448] [2024-11-07 04:51:02,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:51:02,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:51:02,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:51:02,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:51:02,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:51:02,709 INFO L87 Difference]: Start difference. First operand 150 states and 220 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 04:51:02,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:51:02,804 INFO L93 Difference]: Finished difference Result 244 states and 359 transitions. [2024-11-07 04:51:02,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:51:02,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2024-11-07 04:51:02,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:51:02,806 INFO L225 Difference]: With dead ends: 244 [2024-11-07 04:51:02,806 INFO L226 Difference]: Without dead ends: 152 [2024-11-07 04:51:02,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 53 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 04:51:02,807 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 107 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:51:02,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 304 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:51:02,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-07 04:51:02,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2024-11-07 04:51:02,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 95 states have (on average 1.263157894736842) internal successors, (120), 95 states have internal predecessors, (120), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-07 04:51:02,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 220 transitions. [2024-11-07 04:51:02,827 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 220 transitions. Word has length 167 [2024-11-07 04:51:02,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:51:02,827 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 220 transitions. [2024-11-07 04:51:02,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 04:51:02,828 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 220 transitions. [2024-11-07 04:51:02,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 04:51:02,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:51:02,829 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:51:02,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 04:51:02,829 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:51:02,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:51:02,830 INFO L85 PathProgramCache]: Analyzing trace with hash -404164286, now seen corresponding path program 1 times [2024-11-07 04:51:02,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:51:02,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104068413] [2024-11-07 04:51:02,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:51:02,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:51:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:51:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:51:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:51:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:51:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:51:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:51:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:51:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:51:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:51:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:51:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:51:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:51:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:51:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:51:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:51:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:51:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:51:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:51:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:02,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:51:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:03,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:51:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:03,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:51:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:03,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 04:51:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:03,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:51:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:03,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 04:51:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:03,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:51:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:03,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 04:51:03,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:51:03,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104068413] [2024-11-07 04:51:03,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104068413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:51:03,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:51:03,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:51:03,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252179290] [2024-11-07 04:51:03,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:51:03,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:51:03,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:51:03,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:51:03,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:51:03,013 INFO L87 Difference]: Start difference. First operand 150 states and 220 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 04:51:03,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:51:03,045 INFO L93 Difference]: Finished difference Result 242 states and 355 transitions. [2024-11-07 04:51:03,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:51:03,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2024-11-07 04:51:03,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:51:03,049 INFO L225 Difference]: With dead ends: 242 [2024-11-07 04:51:03,049 INFO L226 Difference]: Without dead ends: 150 [2024-11-07 04:51:03,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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 04:51:03,050 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 124 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:51:03,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 267 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:51:03,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-07 04:51:03,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-07 04:51:03,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 95 states have internal predecessors, (118), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-07 04:51:03,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 218 transitions. [2024-11-07 04:51:03,076 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 218 transitions. Word has length 167 [2024-11-07 04:51:03,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:51:03,076 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 218 transitions. [2024-11-07 04:51:03,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 04:51:03,077 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 218 transitions. [2024-11-07 04:51:03,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 04:51:03,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:51:03,078 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:51:03,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 04:51:03,078 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:51:03,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:51:03,078 INFO L85 PathProgramCache]: Analyzing trace with hash 18537540, now seen corresponding path program 1 times [2024-11-07 04:51:03,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:51:03,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073281582] [2024-11-07 04:51:03,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:51:03,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:51:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:51:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:51:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:51:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:51:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:51:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:51:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:51:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:51:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:51:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:51:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:51:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:51:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:51:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:51:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:51:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:51:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:51:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:51:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:51:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:51:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:51:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 04:51:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:51:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 04:51:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:51:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 04:51:51,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:51:51,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073281582] [2024-11-07 04:51:51,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073281582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:51:51,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:51:51,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 04:51:51,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025977863] [2024-11-07 04:51:51,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:51:51,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 04:51:51,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:51:51,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 04:51:51,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-07 04:51:51,155 INFO L87 Difference]: Start difference. First operand 150 states and 218 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 04:51:53,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:51:53,247 INFO L93 Difference]: Finished difference Result 425 states and 605 transitions. [2024-11-07 04:51:53,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 04:51:53,247 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 167 [2024-11-07 04:51:53,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:51:53,249 INFO L225 Difference]: With dead ends: 425 [2024-11-07 04:51:53,249 INFO L226 Difference]: Without dead ends: 335 [2024-11-07 04:51:53,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=173, Invalid=529, Unknown=0, NotChecked=0, Total=702 [2024-11-07 04:51:53,250 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 922 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:51:53,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 640 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 04:51:53,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-07 04:51:53,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 177. [2024-11-07 04:51:53,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 121 states have (on average 1.2727272727272727) internal successors, (154), 121 states have internal predecessors, (154), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-07 04:51:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 254 transitions. [2024-11-07 04:51:53,278 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 254 transitions. Word has length 167 [2024-11-07 04:51:53,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:51:53,278 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 254 transitions. [2024-11-07 04:51:53,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 04:51:53,279 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 254 transitions. [2024-11-07 04:51:53,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 04:51:53,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:51:53,281 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:51:53,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 04:51:53,281 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:51:53,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:51:53,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1166662980, now seen corresponding path program 1 times [2024-11-07 04:51:53,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:51:53,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975604348] [2024-11-07 04:51:53,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:51:53,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:51:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:51:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:51:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:51:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:51:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:51:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:51:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:51:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:51:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:51:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:51:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:51:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:51:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:51:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:51:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:51:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:51:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:51:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:51:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:51:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:51:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:51:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 04:51:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:51:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 04:51:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:51:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:51:59,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 04:51:59,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:51:59,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975604348] [2024-11-07 04:51:59,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975604348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:51:59,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:51:59,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 04:51:59,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810106373] [2024-11-07 04:51:59,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:51:59,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 04:51:59,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:51:59,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 04:51:59,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-11-07 04:51:59,396 INFO L87 Difference]: Start difference. First operand 177 states and 254 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 04:52:00,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:52:00,815 INFO L93 Difference]: Finished difference Result 460 states and 646 transitions. [2024-11-07 04:52:00,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 04:52:00,816 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2024-11-07 04:52:00,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:52:00,818 INFO L225 Difference]: With dead ends: 460 [2024-11-07 04:52:00,818 INFO L226 Difference]: Without dead ends: 370 [2024-11-07 04:52:00,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2024-11-07 04:52:00,819 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 704 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 04:52:00,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 703 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 04:52:00,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-07 04:52:00,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 178. [2024-11-07 04:52:00,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 122 states have (on average 1.278688524590164) internal successors, (156), 122 states have internal predecessors, (156), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-07 04:52:00,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 256 transitions. [2024-11-07 04:52:00,835 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 256 transitions. Word has length 167 [2024-11-07 04:52:00,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:52:00,839 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 256 transitions. [2024-11-07 04:52:00,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 04:52:00,840 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 256 transitions. [2024-11-07 04:52:00,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 04:52:00,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:52:00,841 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:52:00,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 04:52:00,841 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:52:00,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:52:00,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1846721350, now seen corresponding path program 1 times [2024-11-07 04:52:00,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:52:00,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14105002] [2024-11-07 04:52:00,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:52:00,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:52:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:52:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:52:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:52:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:52:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:52:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:52:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:52:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:52:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:52:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:52:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:52:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:52:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:52:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:52:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:52:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:52:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:52:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:52:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:52:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:52:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:52:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 04:52:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:52:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 04:52:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:52:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 04:52:14,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:52:14,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14105002] [2024-11-07 04:52:14,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14105002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:52:14,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:52:14,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 04:52:14,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897746913] [2024-11-07 04:52:14,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:52:14,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 04:52:14,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:52:14,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 04:52:14,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-07 04:52:14,769 INFO L87 Difference]: Start difference. First operand 178 states and 256 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 04:52:15,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:52:15,600 INFO L93 Difference]: Finished difference Result 487 states and 695 transitions. [2024-11-07 04:52:15,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 04:52:15,602 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2024-11-07 04:52:15,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:52:15,604 INFO L225 Difference]: With dead ends: 487 [2024-11-07 04:52:15,604 INFO L226 Difference]: Without dead ends: 397 [2024-11-07 04:52:15,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2024-11-07 04:52:15,605 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 507 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 04:52:15,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 713 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 04:52:15,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-07 04:52:15,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 276. [2024-11-07 04:52:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 192 states have (on average 1.2864583333333333) internal successors, (247), 192 states have internal predecessors, (247), 75 states have call successors, (75), 8 states have call predecessors, (75), 8 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-07 04:52:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 397 transitions. [2024-11-07 04:52:15,630 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 397 transitions. Word has length 167 [2024-11-07 04:52:15,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:52:15,630 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 397 transitions. [2024-11-07 04:52:15,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 04:52:15,630 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 397 transitions. [2024-11-07 04:52:15,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 04:52:15,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:52:15,632 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:52:15,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 04:52:15,632 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:52:15,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:52:15,632 INFO L85 PathProgramCache]: Analyzing trace with hash -239627898, now seen corresponding path program 1 times [2024-11-07 04:52:15,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:52:15,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060625506] [2024-11-07 04:52:15,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:52:15,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:52:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:52:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:52:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:52:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:52:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:52:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:52:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:52:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:52:33,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:52:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:52:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:52:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:52:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:52:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:52:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:52:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:52:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:52:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:52:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:52:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:52:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:52:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 04:52:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:52:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 04:52:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:52:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:52:33,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 04:52:33,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:52:33,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060625506] [2024-11-07 04:52:33,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060625506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:52:33,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:52:33,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-07 04:52:33,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713379642] [2024-11-07 04:52:33,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:52:33,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 04:52:33,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:52:33,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 04:52:33,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-07 04:52:33,264 INFO L87 Difference]: Start difference. First operand 276 states and 397 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25)