./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-92.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_loopvsstraightlinecode_100-while_file-92.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', 'c469b75cc3acec0afb4777ccbc446a0a894bfe2960322167d3fdb024eb8caf56'] 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_loopvsstraightlinecode_100-while_file-92.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 c469b75cc3acec0afb4777ccbc446a0a894bfe2960322167d3fdb024eb8caf56 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:16:06,219 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:16:06,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:16:06,293 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:16:06,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:16:06,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:16:06,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:16:06,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:16:06,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:16:06,322 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:16:06,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:16:06,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:16:06,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:16:06,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:16:06,323 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:16:06,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:16:06,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:16:06,323 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:16:06,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:16:06,323 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:16:06,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:16:06,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:16:06,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:16:06,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:16:06,324 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:16:06,324 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:16:06,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:16:06,324 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:16:06,324 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:16:06,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:16:06,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:16:06,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:16:06,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:16:06,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:16:06,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:16:06,325 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:16:06,325 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:16:06,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:16:06,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:16:06,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:16:06,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:16:06,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:16:06,326 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 -> c469b75cc3acec0afb4777ccbc446a0a894bfe2960322167d3fdb024eb8caf56 [2024-11-07 08:16:06,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:16:06,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:16:06,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:16:06,578 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:16:06,578 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:16:06,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-92.i [2024-11-07 08:16:07,733 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:16:07,953 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:16:07,955 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-92.i [2024-11-07 08:16:07,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4233bb471/9acad521043a4bf3a9922f837765092b/FLAG4763c518f [2024-11-07 08:16:08,299 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4233bb471/9acad521043a4bf3a9922f837765092b [2024-11-07 08:16:08,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:16:08,302 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:16:08,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:16:08,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:16:08,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:16:08,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:16:08" (1/1) ... [2024-11-07 08:16:08,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e4fbaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:16:08, skipping insertion in model container [2024-11-07 08:16:08,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:16:08" (1/1) ... [2024-11-07 08:16:08,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:16:08,425 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_loopvsstraightlinecode_100-while_file-92.i[916,929] [2024-11-07 08:16:08,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:16:08,494 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:16:08,502 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_loopvsstraightlinecode_100-while_file-92.i[916,929] [2024-11-07 08:16:08,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:16:08,540 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:16:08,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:16:08 WrapperNode [2024-11-07 08:16:08,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:16:08,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:16:08,543 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:16:08,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:16:08,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:16:08" (1/1) ... [2024-11-07 08:16:08,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:16:08" (1/1) ... [2024-11-07 08:16:08,600 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 310 [2024-11-07 08:16:08,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:16:08,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:16:08,601 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:16:08,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:16:08,607 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:16:08" (1/1) ... [2024-11-07 08:16:08,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:16:08" (1/1) ... [2024-11-07 08:16:08,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:16:08" (1/1) ... [2024-11-07 08:16:08,635 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 08:16:08,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:16:08" (1/1) ... [2024-11-07 08:16:08,637 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:16:08" (1/1) ... [2024-11-07 08:16:08,650 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:16:08" (1/1) ... [2024-11-07 08:16:08,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:16:08" (1/1) ... [2024-11-07 08:16:08,664 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:16:08" (1/1) ... [2024-11-07 08:16:08,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:16:08" (1/1) ... [2024-11-07 08:16:08,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:16:08,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:16:08,673 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:16:08,673 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:16:08,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:16:08" (1/1) ... [2024-11-07 08:16:08,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:16:08,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:16:08,697 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 08:16:08,700 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 08:16:08,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:16:08,716 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:16:08,716 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:16:08,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:16:08,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:16:08,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:16:08,794 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:16:08,795 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:16:09,320 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-07 08:16:09,321 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:16:09,332 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:16:09,333 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:16:09,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:16:09 BoogieIcfgContainer [2024-11-07 08:16:09,333 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:16:09,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:16:09,336 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:16:09,339 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:16:09,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:16:08" (1/3) ... [2024-11-07 08:16:09,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571329d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:16:09, skipping insertion in model container [2024-11-07 08:16:09,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:16:08" (2/3) ... [2024-11-07 08:16:09,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571329d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:16:09, skipping insertion in model container [2024-11-07 08:16:09,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:16:09" (3/3) ... [2024-11-07 08:16:09,344 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-92.i [2024-11-07 08:16:09,355 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:16:09,356 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:16:09,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:16:09,415 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;@6220b203, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:16:09,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:16:09,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 102 states have (on average 1.5) internal successors, (153), 103 states have internal predecessors, (153), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 08:16:09,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 08:16:09,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:16:09,434 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:16:09,435 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:16:09,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:16:09,440 INFO L85 PathProgramCache]: Analyzing trace with hash 452485311, now seen corresponding path program 1 times [2024-11-07 08:16:09,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:16:09,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890973898] [2024-11-07 08:16:09,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:16:09,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:16:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:09,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:16:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:09,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:16:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:09,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:16:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:09,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:16:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:09,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:16:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:09,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:16:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:09,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 08:16:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:09,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:16:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:09,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 08:16:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:09,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 08:16:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:09,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 08:16:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:09,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 08:16:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:09,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 08:16:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:09,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 08:16:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:09,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 08:16:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:09,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 08:16:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:09,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 08:16:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:09,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 08:16:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:09,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 08:16:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:09,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 08:16:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:09,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:16:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:09,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 08:16:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:09,810 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 08:16:09,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:16:09,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890973898] [2024-11-07 08:16:09,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890973898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:16:09,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:16:09,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:16:09,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480861751] [2024-11-07 08:16:09,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:16:09,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:16:09,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:16:09,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:16:09,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:16:09,831 INFO L87 Difference]: Start difference. First operand has 127 states, 102 states have (on average 1.5) internal successors, (153), 103 states have internal predecessors, (153), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 08:16:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:16:09,851 INFO L93 Difference]: Finished difference Result 247 states and 410 transitions. [2024-11-07 08:16:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:16:09,853 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 159 [2024-11-07 08:16:09,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:16:09,858 INFO L225 Difference]: With dead ends: 247 [2024-11-07 08:16:09,858 INFO L226 Difference]: Without dead ends: 123 [2024-11-07 08:16:09,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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 08:16:09,862 INFO L432 NwaCegarLoop]: 190 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, 190 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 08:16:09,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:16:09,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-07 08:16:09,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-07 08:16:09,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.4747474747474747) internal successors, (146), 99 states have internal predecessors, (146), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 08:16:09,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 190 transitions. [2024-11-07 08:16:09,898 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 190 transitions. Word has length 159 [2024-11-07 08:16:09,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:16:09,899 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 190 transitions. [2024-11-07 08:16:09,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 08:16:09,900 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 190 transitions. [2024-11-07 08:16:09,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 08:16:09,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:16:09,905 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:16:09,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:16:09,905 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:16:09,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:16:09,906 INFO L85 PathProgramCache]: Analyzing trace with hash -91128893, now seen corresponding path program 1 times [2024-11-07 08:16:09,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:16:09,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707367240] [2024-11-07 08:16:09,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:16:09,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:16:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:16:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:16:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:16:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:16:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:16:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:16:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 08:16:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:16:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 08:16:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 08:16:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 08:16:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 08:16:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 08:16:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 08:16:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 08:16:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 08:16:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 08:16:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 08:16:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 08:16:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 08:16:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:16:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 08:16:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 08:16:10,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:16:10,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707367240] [2024-11-07 08:16:10,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707367240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:16:10,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:16:10,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:16:10,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303126782] [2024-11-07 08:16:10,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:16:10,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:16:10,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:16:10,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:16:10,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:16:10,483 INFO L87 Difference]: Start difference. First operand 123 states and 190 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 08:16:10,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:16:10,567 INFO L93 Difference]: Finished difference Result 363 states and 564 transitions. [2024-11-07 08:16:10,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:16:10,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 159 [2024-11-07 08:16:10,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:16:10,569 INFO L225 Difference]: With dead ends: 363 [2024-11-07 08:16:10,570 INFO L226 Difference]: Without dead ends: 243 [2024-11-07 08:16:10,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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 08:16:10,571 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 135 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:16:10,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 427 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:16:10,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-07 08:16:10,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2024-11-07 08:16:10,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 194 states have (on average 1.4742268041237114) internal successors, (286), 194 states have internal predecessors, (286), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-07 08:16:10,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 374 transitions. [2024-11-07 08:16:10,608 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 374 transitions. Word has length 159 [2024-11-07 08:16:10,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:16:10,609 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 374 transitions. [2024-11-07 08:16:10,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 08:16:10,609 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 374 transitions. [2024-11-07 08:16:10,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 08:16:10,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:16:10,611 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:16:10,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:16:10,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:16:10,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:16:10,613 INFO L85 PathProgramCache]: Analyzing trace with hash -874005863, now seen corresponding path program 1 times [2024-11-07 08:16:10,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:16:10,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040207294] [2024-11-07 08:16:10,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:16:10,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:16:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:16:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:16:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:16:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:16:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:16:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:16:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:10,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 08:16:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:16:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 08:16:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 08:16:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 08:16:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 08:16:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 08:16:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 08:16:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 08:16:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 08:16:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 08:16:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 08:16:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 08:16:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 08:16:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:16:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 08:16:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,091 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 08:16:11,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:16:11,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040207294] [2024-11-07 08:16:11,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040207294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:16:11,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:16:11,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 08:16:11,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133753120] [2024-11-07 08:16:11,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:16:11,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:16:11,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:16:11,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:16:11,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:16:11,095 INFO L87 Difference]: Start difference. First operand 241 states and 374 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 08:16:11,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:16:11,439 INFO L93 Difference]: Finished difference Result 1075 states and 1655 transitions. [2024-11-07 08:16:11,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 08:16:11,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2024-11-07 08:16:11,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:16:11,444 INFO L225 Difference]: With dead ends: 1075 [2024-11-07 08:16:11,445 INFO L226 Difference]: Without dead ends: 837 [2024-11-07 08:16:11,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:16:11,449 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 583 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:16:11,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 747 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:16:11,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-11-07 08:16:11,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 489. [2024-11-07 08:16:11,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 396 states have (on average 1.4848484848484849) internal successors, (588), 396 states have internal predecessors, (588), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-07 08:16:11,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 764 transitions. [2024-11-07 08:16:11,512 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 764 transitions. Word has length 160 [2024-11-07 08:16:11,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:16:11,512 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 764 transitions. [2024-11-07 08:16:11,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 08:16:11,513 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 764 transitions. [2024-11-07 08:16:11,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 08:16:11,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:16:11,515 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:16:11,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:16:11,515 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:16:11,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:16:11,516 INFO L85 PathProgramCache]: Analyzing trace with hash -739992357, now seen corresponding path program 1 times [2024-11-07 08:16:11,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:16:11,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965156065] [2024-11-07 08:16:11,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:16:11,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:16:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:16:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:16:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:16:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:16:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:16:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:16:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 08:16:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:16:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:11,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 08:16:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:12,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 08:16:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:12,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 08:16:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:12,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 08:16:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:12,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 08:16:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:12,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 08:16:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:12,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 08:16:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:12,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 08:16:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:12,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 08:16:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:12,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 08:16:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:12,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 08:16:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:12,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 08:16:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:12,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:16:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:12,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 08:16:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:12,064 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 08:16:12,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:16:12,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965156065] [2024-11-07 08:16:12,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965156065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:16:12,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:16:12,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 08:16:12,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430957300] [2024-11-07 08:16:12,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:16:12,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 08:16:12,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:16:12,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 08:16:12,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 08:16:12,067 INFO L87 Difference]: Start difference. First operand 489 states and 764 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 08:16:12,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:16:12,964 INFO L93 Difference]: Finished difference Result 1315 states and 2034 transitions. [2024-11-07 08:16:12,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 08:16:12,965 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2024-11-07 08:16:12,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:16:12,973 INFO L225 Difference]: With dead ends: 1315 [2024-11-07 08:16:12,975 INFO L226 Difference]: Without dead ends: 1071 [2024-11-07 08:16:12,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-07 08:16:12,978 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 1478 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 08:16:12,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 990 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 08:16:12,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-11-07 08:16:13,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 637. [2024-11-07 08:16:13,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 523 states have (on average 1.491395793499044) internal successors, (780), 524 states have internal predecessors, (780), 108 states have call successors, (108), 5 states have call predecessors, (108), 5 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-07 08:16:13,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 996 transitions. [2024-11-07 08:16:13,047 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 996 transitions. Word has length 160 [2024-11-07 08:16:13,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:16:13,047 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 996 transitions. [2024-11-07 08:16:13,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 08:16:13,048 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 996 transitions. [2024-11-07 08:16:13,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 08:16:13,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:16:13,050 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:16:13,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 08:16:13,050 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:16:13,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:16:13,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1142759509, now seen corresponding path program 1 times [2024-11-07 08:16:13,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:16:13,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833946922] [2024-11-07 08:16:13,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:16:13,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:16:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:34,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:16:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:34,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:16:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:34,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:16:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:34,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:16:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:34,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:16:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:34,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:16:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:34,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 08:16:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:34,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:16:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:34,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 08:16:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:34,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 08:16:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:34,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 08:16:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:34,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 08:16:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:34,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 08:16:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:34,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 08:16:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:34,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 08:16:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:34,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 08:16:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:34,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 08:16:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:34,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 08:16:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:34,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 08:16:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:34,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 08:16:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:34,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:16:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:34,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 08:16:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 08:16:34,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:16:34,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833946922] [2024-11-07 08:16:34,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833946922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:16:34,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:16:34,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 08:16:34,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705845101] [2024-11-07 08:16:34,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:16:34,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 08:16:34,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:16:34,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 08:16:34,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:16:34,458 INFO L87 Difference]: Start difference. First operand 637 states and 996 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 08:16:38,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:16:38,287 INFO L93 Difference]: Finished difference Result 2022 states and 3140 transitions. [2024-11-07 08:16:38,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 08:16:38,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2024-11-07 08:16:38,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:16:38,298 INFO L225 Difference]: With dead ends: 2022 [2024-11-07 08:16:38,298 INFO L226 Difference]: Without dead ends: 1388 [2024-11-07 08:16:38,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-07 08:16:38,303 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 342 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-07 08:16:38,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 699 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-07 08:16:38,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-11-07 08:16:38,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 858. [2024-11-07 08:16:38,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 744 states have (on average 1.5295698924731183) internal successors, (1138), 745 states have internal predecessors, (1138), 108 states have call successors, (108), 5 states have call predecessors, (108), 5 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-07 08:16:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1354 transitions. [2024-11-07 08:16:38,365 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1354 transitions. Word has length 160 [2024-11-07 08:16:38,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:16:38,365 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1354 transitions. [2024-11-07 08:16:38,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 08:16:38,366 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1354 transitions. [2024-11-07 08:16:38,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 08:16:38,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:16:38,368 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:16:38,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 08:16:38,368 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:16:38,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:16:38,369 INFO L85 PathProgramCache]: Analyzing trace with hash -923904791, now seen corresponding path program 1 times [2024-11-07 08:16:38,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:16:38,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250713470] [2024-11-07 08:16:38,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:16:38,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:16:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:41,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:16:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:41,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:16:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:41,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:16:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:41,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:16:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:41,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:16:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:41,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:16:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:41,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 08:16:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:41,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:16:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:41,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 08:16:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:41,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 08:16:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:41,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 08:16:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:41,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 08:16:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:41,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 08:16:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:41,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 08:16:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:41,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 08:16:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:41,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 08:16:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:41,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 08:16:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:41,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 08:16:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:41,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 08:16:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:41,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 08:16:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:41,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:16:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:41,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 08:16:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:16:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 08:16:41,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:16:41,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250713470] [2024-11-07 08:16:41,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250713470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:16:41,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:16:41,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 08:16:41,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133578693] [2024-11-07 08:16:41,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:16:41,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 08:16:41,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:16:41,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 08:16:41,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:16:41,346 INFO L87 Difference]: Start difference. First operand 858 states and 1354 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 08:16:44,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:16:44,289 INFO L93 Difference]: Finished difference Result 2385 states and 3722 transitions. [2024-11-07 08:16:44,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 08:16:44,290 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2024-11-07 08:16:44,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:16:44,297 INFO L225 Difference]: With dead ends: 2385 [2024-11-07 08:16:44,297 INFO L226 Difference]: Without dead ends: 1530 [2024-11-07 08:16:44,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-07 08:16:44,299 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 499 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:16:44,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 616 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 08:16:44,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2024-11-07 08:16:44,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 858. [2024-11-07 08:16:44,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 744 states have (on average 1.5295698924731183) internal successors, (1138), 745 states have internal predecessors, (1138), 108 states have call successors, (108), 5 states have call predecessors, (108), 5 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-07 08:16:44,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1354 transitions. [2024-11-07 08:16:44,334 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1354 transitions. Word has length 160 [2024-11-07 08:16:44,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:16:44,335 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1354 transitions. [2024-11-07 08:16:44,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 08:16:44,335 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1354 transitions. [2024-11-07 08:16:44,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 08:16:44,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:16:44,337 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:16:44,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 08:16:44,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:16:44,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:16:44,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1100840619, now seen corresponding path program 1 times [2024-11-07 08:16:44,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:16:44,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68550391] [2024-11-07 08:16:44,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:16:44,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:16:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:41,402 WARN L286 SmtUtils]: Spent 5.83s on a formula simplification. DAG size of input: 193 DAG size of output: 133 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-07 08:17:41,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:17:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:41,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:17:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:41,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:17:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:41,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:17:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:41,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:17:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:41,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:17:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:41,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 08:17:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:41,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:17:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:41,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 08:17:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:41,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 08:17:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:41,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 08:17:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:41,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 08:17:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:41,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 08:17:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:41,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 08:17:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:41,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 08:17:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:41,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 08:17:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:41,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 08:17:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:41,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 08:17:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:41,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 08:17:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:41,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 08:17:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:41,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:17:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:41,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 08:17:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 08:17:41,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:17:41,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68550391] [2024-11-07 08:17:41,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68550391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:17:41,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:17:41,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 08:17:41,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484864929] [2024-11-07 08:17:41,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:17:41,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 08:17:41,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:17:41,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 08:17:41,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:17:41,465 INFO L87 Difference]: Start difference. First operand 858 states and 1354 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)