./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.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', '736d11fbaff9bd8217e7f35fe2915a40a2ccc3f0b056dd854b0369e62e08ee86'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.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 736d11fbaff9bd8217e7f35fe2915a40a2ccc3f0b056dd854b0369e62e08ee86 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:29:22,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:29:22,700 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 09:29:22,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:29:22,706 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:29:22,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:29:22,745 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:29:22,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:29:22,746 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:29:22,746 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:29:22,747 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:29:22,747 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:29:22,747 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:29:22,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:29:22,748 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:29:22,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:29:22,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:29:22,749 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:29:22,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 09:29:22,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:29:22,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:29:22,749 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:29:22,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:29:22,749 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:29:22,749 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:29:22,749 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:29:22,749 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:29:22,749 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:29:22,749 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:29:22,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:29:22,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:29:22,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:29:22,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:29:22,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:29:22,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:29:22,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:29:22,750 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 09:29:22,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 09:29:22,750 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:29:22,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:29:22,750 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:29:22,750 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:29:22,750 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 -> 736d11fbaff9bd8217e7f35fe2915a40a2ccc3f0b056dd854b0369e62e08ee86 [2024-11-07 09:29:23,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:29:23,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:29:23,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:29:23,079 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:29:23,080 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:29:23,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i [2024-11-07 09:29:24,358 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:29:24,574 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:29:24,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i [2024-11-07 09:29:24,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6210f3f5d/7aac144eefeb473cbf281e53a753e3a7/FLAG94fbb0720 [2024-11-07 09:29:24,596 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6210f3f5d/7aac144eefeb473cbf281e53a753e3a7 [2024-11-07 09:29:24,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:29:24,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:29:24,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:29:24,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:29:24,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:29:24,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:29:24" (1/1) ... [2024-11-07 09:29:24,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4012e886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:24, skipping insertion in model container [2024-11-07 09:29:24,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:29:24" (1/1) ... [2024-11-07 09:29:24,618 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:29:24,735 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i[915,928] [2024-11-07 09:29:24,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:29:24,782 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:29:24,792 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i[915,928] [2024-11-07 09:29:24,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:29:24,827 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:29:24,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:24 WrapperNode [2024-11-07 09:29:24,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:29:24,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:29:24,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:29:24,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:29:24,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:24" (1/1) ... [2024-11-07 09:29:24,849 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:24" (1/1) ... [2024-11-07 09:29:24,909 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-11-07 09:29:24,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:29:24,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:29:24,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:29:24,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:29:24,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:24" (1/1) ... [2024-11-07 09:29:24,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:24" (1/1) ... [2024-11-07 09:29:24,925 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:24" (1/1) ... [2024-11-07 09:29:24,954 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 09:29:24,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:24" (1/1) ... [2024-11-07 09:29:24,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:24" (1/1) ... [2024-11-07 09:29:24,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:24" (1/1) ... [2024-11-07 09:29:24,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:24" (1/1) ... [2024-11-07 09:29:24,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:24" (1/1) ... [2024-11-07 09:29:24,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:24" (1/1) ... [2024-11-07 09:29:24,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:29:24,996 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:29:24,997 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:29:24,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:29:24,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:24" (1/1) ... [2024-11-07 09:29:25,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:29:25,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:29:25,036 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 09:29:25,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 09:29:25,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:29:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:29:25,067 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:29:25,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 09:29:25,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:29:25,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:29:25,152 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:29:25,154 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:29:25,484 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-07 09:29:25,485 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:29:25,497 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:29:25,497 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:29:25,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:29:25 BoogieIcfgContainer [2024-11-07 09:29:25,498 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:29:25,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:29:25,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:29:25,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:29:25,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:29:24" (1/3) ... [2024-11-07 09:29:25,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7684ea98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:29:25, skipping insertion in model container [2024-11-07 09:29:25,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:24" (2/3) ... [2024-11-07 09:29:25,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7684ea98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:29:25, skipping insertion in model container [2024-11-07 09:29:25,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:29:25" (3/3) ... [2024-11-07 09:29:25,510 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-32.i [2024-11-07 09:29:25,539 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:29:25,540 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:29:25,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:29:25,604 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;@540881ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:29:25,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:29:25,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 60 states have (on average 1.45) internal successors, (87), 61 states have internal predecessors, (87), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 09:29:25,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 09:29:25,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:25,620 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:25,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:25,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:25,625 INFO L85 PathProgramCache]: Analyzing trace with hash -571826580, now seen corresponding path program 1 times [2024-11-07 09:29:25,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:29:25,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321958893] [2024-11-07 09:29:25,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:25,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:29:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:25,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:29:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:25,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:29:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:25,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:29:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:25,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:29:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:25,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:29:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:25,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:29:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:25,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:29:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:25,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:29:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:25,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:29:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:25,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:29:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:25,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:29:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:25,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:29:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:25,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:29:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:25,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:29:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:25,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:29:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:25,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:29:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:29:25,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:29:25,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321958893] [2024-11-07 09:29:25,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321958893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:29:25,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:29:25,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:29:25,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017308370] [2024-11-07 09:29:25,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:29:25,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:29:25,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:29:25,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:29:25,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:29:25,991 INFO L87 Difference]: Start difference. First operand has 79 states, 60 states have (on average 1.45) internal successors, (87), 61 states have internal predecessors, (87), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 09:29:26,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:29:26,022 INFO L93 Difference]: Finished difference Result 151 states and 248 transitions. [2024-11-07 09:29:26,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:29:26,024 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 110 [2024-11-07 09:29:26,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:29:26,031 INFO L225 Difference]: With dead ends: 151 [2024-11-07 09:29:26,031 INFO L226 Difference]: Without dead ends: 75 [2024-11-07 09:29:26,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:29:26,040 INFO L432 NwaCegarLoop]: 112 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, 112 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:29:26,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:29:26,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-07 09:29:26,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-07 09:29:26,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 09:29:26,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 112 transitions. [2024-11-07 09:29:26,089 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 112 transitions. Word has length 110 [2024-11-07 09:29:26,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:29:26,090 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 112 transitions. [2024-11-07 09:29:26,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 09:29:26,091 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 112 transitions. [2024-11-07 09:29:26,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 09:29:26,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:26,095 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:26,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 09:29:26,095 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:26,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:26,096 INFO L85 PathProgramCache]: Analyzing trace with hash 153189996, now seen corresponding path program 1 times [2024-11-07 09:29:26,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:29:26,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909210598] [2024-11-07 09:29:26,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:26,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:29:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:26,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:29:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:26,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:29:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:26,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:29:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:26,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:29:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:26,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:29:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:26,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:29:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:26,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:29:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:26,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:29:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:26,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:29:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:26,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:29:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:26,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:29:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:26,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:29:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:26,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:29:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:26,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:29:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:26,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:29:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:26,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:29:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:26,718 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:29:26,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:29:26,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909210598] [2024-11-07 09:29:26,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909210598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:29:26,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:29:26,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 09:29:26,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268003072] [2024-11-07 09:29:26,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:29:26,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 09:29:26,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:29:26,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 09:29:26,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 09:29:26,724 INFO L87 Difference]: Start difference. First operand 75 states and 112 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:26,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:29:26,897 INFO L93 Difference]: Finished difference Result 255 states and 383 transitions. [2024-11-07 09:29:26,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 09:29:26,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2024-11-07 09:29:26,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:29:26,902 INFO L225 Difference]: With dead ends: 255 [2024-11-07 09:29:26,904 INFO L226 Difference]: Without dead ends: 183 [2024-11-07 09:29:26,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 09:29:26,906 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 142 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:29:26,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 366 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:29:26,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-07 09:29:26,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 145. [2024-11-07 09:29:26,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 09:29:26,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 219 transitions. [2024-11-07 09:29:26,947 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 219 transitions. Word has length 110 [2024-11-07 09:29:26,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:29:26,947 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 219 transitions. [2024-11-07 09:29:26,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:26,947 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2024-11-07 09:29:26,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 09:29:26,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:26,949 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:26,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 09:29:26,949 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:26,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:26,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1435157906, now seen corresponding path program 1 times [2024-11-07 09:29:26,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:29:26,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838384796] [2024-11-07 09:29:26,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:26,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:29:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:29:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:29:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:29:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:29:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:29:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:29:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:29:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:29:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:29:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:29:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:29:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:29:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:29:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:29:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:29:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:29:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,278 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:29:27,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:29:27,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838384796] [2024-11-07 09:29:27,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838384796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:29:27,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:29:27,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 09:29:27,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217759910] [2024-11-07 09:29:27,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:29:27,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 09:29:27,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:29:27,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 09:29:27,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 09:29:27,287 INFO L87 Difference]: Start difference. First operand 145 states and 219 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:27,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:29:27,473 INFO L93 Difference]: Finished difference Result 406 states and 616 transitions. [2024-11-07 09:29:27,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 09:29:27,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2024-11-07 09:29:27,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:29:27,477 INFO L225 Difference]: With dead ends: 406 [2024-11-07 09:29:27,477 INFO L226 Difference]: Without dead ends: 264 [2024-11-07 09:29:27,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:29:27,479 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 125 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:29:27,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 405 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:29:27,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-07 09:29:27,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 192. [2024-11-07 09:29:27,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 140 states have (on average 1.3928571428571428) internal successors, (195), 140 states have internal predecessors, (195), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 09:29:27,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 291 transitions. [2024-11-07 09:29:27,514 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 291 transitions. Word has length 110 [2024-11-07 09:29:27,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:29:27,515 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 291 transitions. [2024-11-07 09:29:27,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:27,516 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 291 transitions. [2024-11-07 09:29:27,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 09:29:27,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:27,519 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:27,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 09:29:27,520 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:27,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:27,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1846945656, now seen corresponding path program 1 times [2024-11-07 09:29:27,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:29:27,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618654137] [2024-11-07 09:29:27,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:27,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:29:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:29:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:29:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:29:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:29:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:29:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:29:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:29:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:29:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:29:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:29:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:29:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:29:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:29:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:29:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:29:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:29:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:29:27,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:29:27,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618654137] [2024-11-07 09:29:27,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618654137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:29:27,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:29:27,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 09:29:27,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932106757] [2024-11-07 09:29:27,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:29:27,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 09:29:27,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:29:27,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 09:29:27,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:29:27,788 INFO L87 Difference]: Start difference. First operand 192 states and 291 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:27,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:29:27,850 INFO L93 Difference]: Finished difference Result 402 states and 612 transitions. [2024-11-07 09:29:27,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 09:29:27,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-11-07 09:29:27,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:29:27,858 INFO L225 Difference]: With dead ends: 402 [2024-11-07 09:29:27,858 INFO L226 Difference]: Without dead ends: 260 [2024-11-07 09:29:27,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:29:27,861 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 73 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:29:27,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 203 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:29:27,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-07 09:29:27,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2024-11-07 09:29:27,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 189 states have (on average 1.380952380952381) internal successors, (261), 189 states have internal predecessors, (261), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 09:29:27,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 389 transitions. [2024-11-07 09:29:27,916 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 389 transitions. Word has length 111 [2024-11-07 09:29:27,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:29:27,917 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 389 transitions. [2024-11-07 09:29:27,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:27,918 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 389 transitions. [2024-11-07 09:29:27,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 09:29:27,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:27,920 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:27,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 09:29:27,920 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:27,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:27,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1320145322, now seen corresponding path program 1 times [2024-11-07 09:29:27,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:29:27,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277522672] [2024-11-07 09:29:27,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:27,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:29:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:28,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:29:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:28,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:29:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:28,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:29:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:28,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:29:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:28,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:29:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:28,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:29:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:28,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:29:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:28,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:29:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:28,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:29:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:28,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:29:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:28,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:29:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:28,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:29:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:28,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:29:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:28,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:29:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:28,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:29:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:28,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:29:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:28,556 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:29:28,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:29:28,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277522672] [2024-11-07 09:29:28,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277522672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:29:28,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:29:28,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 09:29:28,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957138080] [2024-11-07 09:29:28,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:29:28,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 09:29:28,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:29:28,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 09:29:28,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 09:29:28,562 INFO L87 Difference]: Start difference. First operand 258 states and 389 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:28,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:29:28,867 INFO L93 Difference]: Finished difference Result 586 states and 873 transitions. [2024-11-07 09:29:28,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 09:29:28,869 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-11-07 09:29:28,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:29:28,873 INFO L225 Difference]: With dead ends: 586 [2024-11-07 09:29:28,874 INFO L226 Difference]: Without dead ends: 374 [2024-11-07 09:29:28,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:29:28,876 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 132 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 09:29:28,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 332 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 09:29:28,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-07 09:29:28,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 334. [2024-11-07 09:29:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 265 states have (on average 1.4) internal successors, (371), 265 states have internal predecessors, (371), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 09:29:28,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 499 transitions. [2024-11-07 09:29:28,916 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 499 transitions. Word has length 111 [2024-11-07 09:29:28,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:29:28,920 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 499 transitions. [2024-11-07 09:29:28,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:28,921 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 499 transitions. [2024-11-07 09:29:28,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 09:29:28,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:28,922 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:28,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 09:29:28,922 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:28,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:28,923 INFO L85 PathProgramCache]: Analyzing trace with hash -217033849, now seen corresponding path program 1 times [2024-11-07 09:29:28,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:29:28,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452646240] [2024-11-07 09:29:28,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:28,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:29:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:29:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:29:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:29:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:29:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:29:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:29:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:29:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:29:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:29:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:29:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:29:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:29:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:29:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:29:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:29:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:29:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:29:29,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:29:29,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452646240] [2024-11-07 09:29:29,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452646240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:29:29,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:29:29,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 09:29:29,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231752797] [2024-11-07 09:29:29,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:29:29,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 09:29:29,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:29:29,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 09:29:29,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 09:29:29,524 INFO L87 Difference]: Start difference. First operand 334 states and 499 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:29,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:29:29,743 INFO L93 Difference]: Finished difference Result 606 states and 903 transitions. [2024-11-07 09:29:29,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 09:29:29,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-11-07 09:29:29,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:29:29,748 INFO L225 Difference]: With dead ends: 606 [2024-11-07 09:29:29,748 INFO L226 Difference]: Without dead ends: 323 [2024-11-07 09:29:29,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 09:29:29,750 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 95 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 09:29:29,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 322 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 09:29:29,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-07 09:29:29,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 309. [2024-11-07 09:29:29,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 240 states have (on average 1.35) internal successors, (324), 240 states have internal predecessors, (324), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 09:29:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 452 transitions. [2024-11-07 09:29:29,776 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 452 transitions. Word has length 112 [2024-11-07 09:29:29,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:29:29,776 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 452 transitions. [2024-11-07 09:29:29,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:29,777 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 452 transitions. [2024-11-07 09:29:29,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 09:29:29,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:29,778 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:29,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 09:29:29,778 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:29,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:29,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1780310582, now seen corresponding path program 1 times [2024-11-07 09:29:29,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:29:29,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420641539] [2024-11-07 09:29:29,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:29,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:29:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:29:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:29:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:29:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:29:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:29:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:29:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:29:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:29:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:29:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:29:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:29:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:29:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:29:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:29:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:29:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:29:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:29,976 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:29:29,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:29:29,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420641539] [2024-11-07 09:29:29,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420641539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:29:29,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:29:29,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 09:29:29,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059381756] [2024-11-07 09:29:29,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:29:29,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 09:29:29,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:29:29,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 09:29:29,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 09:29:29,979 INFO L87 Difference]: Start difference. First operand 309 states and 452 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:30,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:29:30,109 INFO L93 Difference]: Finished difference Result 636 states and 929 transitions. [2024-11-07 09:29:30,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 09:29:30,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2024-11-07 09:29:30,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:29:30,114 INFO L225 Difference]: With dead ends: 636 [2024-11-07 09:29:30,114 INFO L226 Difference]: Without dead ends: 382 [2024-11-07 09:29:30,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:29:30,116 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 90 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:29:30,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 402 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:29:30,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-07 09:29:30,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 339. [2024-11-07 09:29:30,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 270 states have (on average 1.3555555555555556) internal successors, (366), 270 states have internal predecessors, (366), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 09:29:30,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 494 transitions. [2024-11-07 09:29:30,151 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 494 transitions. Word has length 115 [2024-11-07 09:29:30,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:29:30,152 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 494 transitions. [2024-11-07 09:29:30,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:30,152 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 494 transitions. [2024-11-07 09:29:30,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 09:29:30,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:30,153 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:30,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 09:29:30,154 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:30,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:30,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1104085425, now seen corresponding path program 1 times [2024-11-07 09:29:30,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:29:30,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683361745] [2024-11-07 09:29:30,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:30,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:29:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:31,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:29:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:31,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:29:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:31,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:29:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:31,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:29:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:31,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:29:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:31,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:29:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:31,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:29:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:31,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:29:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:31,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:29:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:31,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:29:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:31,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:29:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:31,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:29:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:31,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:29:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:31,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:29:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:31,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:29:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:31,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:29:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:31,718 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:29:31,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:29:31,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683361745] [2024-11-07 09:29:31,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683361745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:29:31,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:29:31,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 09:29:31,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730487777] [2024-11-07 09:29:31,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:29:31,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 09:29:31,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:29:31,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 09:29:31,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 09:29:31,720 INFO L87 Difference]: Start difference. First operand 339 states and 494 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:33,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:29:33,889 INFO L93 Difference]: Finished difference Result 757 states and 1100 transitions. [2024-11-07 09:29:33,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 09:29:33,890 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-07 09:29:33,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:29:33,893 INFO L225 Difference]: With dead ends: 757 [2024-11-07 09:29:33,893 INFO L226 Difference]: Without dead ends: 503 [2024-11-07 09:29:33,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-07 09:29:33,895 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 53 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 09:29:33,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 667 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 09:29:33,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-07 09:29:33,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 423. [2024-11-07 09:29:33,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 354 states have (on average 1.3672316384180792) internal successors, (484), 354 states have internal predecessors, (484), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 09:29:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 612 transitions. [2024-11-07 09:29:33,944 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 612 transitions. Word has length 116 [2024-11-07 09:29:33,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:29:33,946 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 612 transitions. [2024-11-07 09:29:33,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:33,947 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 612 transitions. [2024-11-07 09:29:33,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 09:29:33,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:33,948 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:33,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 09:29:33,949 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:33,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:33,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2115202675, now seen corresponding path program 1 times [2024-11-07 09:29:33,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:29:33,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705099210] [2024-11-07 09:29:33,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:33,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:29:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:35,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:29:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:35,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:29:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:35,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:29:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:35,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:29:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:35,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:29:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:35,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:29:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:35,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:29:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:35,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:29:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:35,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:29:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:35,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:29:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:35,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:29:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:35,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:29:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:35,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:29:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:35,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:29:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:35,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:29:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:35,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:29:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:35,339 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:29:35,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:29:35,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705099210] [2024-11-07 09:29:35,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705099210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:29:35,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:29:35,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 09:29:35,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29603758] [2024-11-07 09:29:35,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:29:35,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 09:29:35,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:29:35,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 09:29:35,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 09:29:35,342 INFO L87 Difference]: Start difference. First operand 423 states and 612 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:37,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:29:37,333 INFO L93 Difference]: Finished difference Result 888 states and 1279 transitions. [2024-11-07 09:29:37,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 09:29:37,334 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-07 09:29:37,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:29:37,339 INFO L225 Difference]: With dead ends: 888 [2024-11-07 09:29:37,339 INFO L226 Difference]: Without dead ends: 571 [2024-11-07 09:29:37,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-07 09:29:37,343 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 53 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 09:29:37,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 761 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 09:29:37,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2024-11-07 09:29:37,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 423. [2024-11-07 09:29:37,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 354 states have (on average 1.3672316384180792) internal successors, (484), 354 states have internal predecessors, (484), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 09:29:37,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 612 transitions. [2024-11-07 09:29:37,394 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 612 transitions. Word has length 116 [2024-11-07 09:29:37,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:29:37,394 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 612 transitions. [2024-11-07 09:29:37,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:37,395 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 612 transitions. [2024-11-07 09:29:37,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 09:29:37,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:37,397 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:37,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 09:29:37,397 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:37,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:37,398 INFO L85 PathProgramCache]: Analyzing trace with hash 450165509, now seen corresponding path program 1 times [2024-11-07 09:29:37,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:29:37,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714295240] [2024-11-07 09:29:37,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:37,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:29:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:37,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:29:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:37,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:29:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:37,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:29:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:37,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:29:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:37,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:29:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:37,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:29:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:37,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:29:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:37,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:29:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:37,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:29:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:37,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:29:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:37,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:29:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:37,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:29:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:37,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:29:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:37,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:29:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:37,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:29:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:37,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:29:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:29:37,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:29:37,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714295240] [2024-11-07 09:29:37,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714295240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:29:37,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:29:37,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 09:29:37,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147132919] [2024-11-07 09:29:37,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:29:37,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 09:29:37,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:29:37,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 09:29:37,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 09:29:37,662 INFO L87 Difference]: Start difference. First operand 423 states and 612 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:37,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:29:37,999 INFO L93 Difference]: Finished difference Result 886 states and 1270 transitions. [2024-11-07 09:29:38,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 09:29:38,000 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-07 09:29:38,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:29:38,004 INFO L225 Difference]: With dead ends: 886 [2024-11-07 09:29:38,004 INFO L226 Difference]: Without dead ends: 569 [2024-11-07 09:29:38,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-07 09:29:38,009 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 172 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 09:29:38,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 606 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 09:29:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-07 09:29:38,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 450. [2024-11-07 09:29:38,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 381 states have (on average 1.3648293963254594) internal successors, (520), 381 states have internal predecessors, (520), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 09:29:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 648 transitions. [2024-11-07 09:29:38,043 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 648 transitions. Word has length 117 [2024-11-07 09:29:38,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:29:38,043 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 648 transitions. [2024-11-07 09:29:38,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:38,043 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 648 transitions. [2024-11-07 09:29:38,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 09:29:38,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:38,045 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:38,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 09:29:38,046 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:38,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:38,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2035710686, now seen corresponding path program 1 times [2024-11-07 09:29:38,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:29:38,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110275146] [2024-11-07 09:29:38,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:38,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:29:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:29:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:29:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:29:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:29:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:29:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:29:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:29:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:29:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:29:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:29:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:29:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:29:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:29:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:29:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:29:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:29:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,283 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:29:38,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:29:38,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110275146] [2024-11-07 09:29:38,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110275146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:29:38,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:29:38,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 09:29:38,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902330004] [2024-11-07 09:29:38,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:29:38,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 09:29:38,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:29:38,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 09:29:38,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 09:29:38,285 INFO L87 Difference]: Start difference. First operand 450 states and 648 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:38,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:29:38,600 INFO L93 Difference]: Finished difference Result 938 states and 1345 transitions. [2024-11-07 09:29:38,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 09:29:38,601 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-07 09:29:38,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:29:38,605 INFO L225 Difference]: With dead ends: 938 [2024-11-07 09:29:38,605 INFO L226 Difference]: Without dead ends: 621 [2024-11-07 09:29:38,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-07 09:29:38,607 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 174 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 09:29:38,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 912 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 09:29:38,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-11-07 09:29:38,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 553. [2024-11-07 09:29:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 466 states have (on average 1.349785407725322) internal successors, (629), 468 states have internal predecessors, (629), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-07 09:29:38,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 789 transitions. [2024-11-07 09:29:38,645 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 789 transitions. Word has length 117 [2024-11-07 09:29:38,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:29:38,645 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 789 transitions. [2024-11-07 09:29:38,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:38,646 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 789 transitions. [2024-11-07 09:29:38,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 09:29:38,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:38,647 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:38,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 09:29:38,648 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:38,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:38,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1238361545, now seen corresponding path program 1 times [2024-11-07 09:29:38,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:29:38,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711452218] [2024-11-07 09:29:38,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:38,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:29:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:29:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:29:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:29:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:29:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:29:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:29:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:29:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:29:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:29:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:29:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:29:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:29:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:29:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:29:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:29:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:29:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:38,738 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:29:38,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:29:38,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711452218] [2024-11-07 09:29:38,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711452218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:29:38,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:29:38,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 09:29:38,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793951810] [2024-11-07 09:29:38,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:29:38,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 09:29:38,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:29:38,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 09:29:38,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:29:38,740 INFO L87 Difference]: Start difference. First operand 553 states and 789 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:38,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:29:38,794 INFO L93 Difference]: Finished difference Result 1194 states and 1698 transitions. [2024-11-07 09:29:38,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 09:29:38,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-07 09:29:38,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:29:38,800 INFO L225 Difference]: With dead ends: 1194 [2024-11-07 09:29:38,801 INFO L226 Difference]: Without dead ends: 786 [2024-11-07 09:29:38,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:29:38,803 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 51 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:29:38,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 203 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:29:38,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-11-07 09:29:38,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 781. [2024-11-07 09:29:38,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 676 states have (on average 1.3387573964497042) internal successors, (905), 681 states have internal predecessors, (905), 92 states have call successors, (92), 12 states have call predecessors, (92), 12 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-07 09:29:38,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1089 transitions. [2024-11-07 09:29:38,847 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1089 transitions. Word has length 118 [2024-11-07 09:29:38,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:29:38,847 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1089 transitions. [2024-11-07 09:29:38,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:38,847 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1089 transitions. [2024-11-07 09:29:38,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 09:29:38,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:38,849 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:38,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 09:29:38,850 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:38,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:38,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1512025676, now seen corresponding path program 1 times [2024-11-07 09:29:38,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:29:38,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411498045] [2024-11-07 09:29:38,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:38,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:29:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:39,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:29:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:39,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:29:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:39,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:29:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:39,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:29:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:39,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:29:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:39,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:29:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:39,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:29:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:39,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:29:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:39,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:29:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:39,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:29:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:39,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:29:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:39,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:29:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:39,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:29:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:39,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:29:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:39,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:29:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:39,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:29:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:39,282 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:29:39,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:29:39,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411498045] [2024-11-07 09:29:39,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411498045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:29:39,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:29:39,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 09:29:39,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236879242] [2024-11-07 09:29:39,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:29:39,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 09:29:39,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:29:39,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 09:29:39,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:29:39,285 INFO L87 Difference]: Start difference. First operand 781 states and 1089 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:39,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:29:39,515 INFO L93 Difference]: Finished difference Result 916 states and 1266 transitions. [2024-11-07 09:29:39,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 09:29:39,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-07 09:29:39,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:29:39,522 INFO L225 Difference]: With dead ends: 916 [2024-11-07 09:29:39,522 INFO L226 Difference]: Without dead ends: 914 [2024-11-07 09:29:39,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 09:29:39,523 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 65 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:29:39,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 735 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:29:39,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2024-11-07 09:29:39,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 910. [2024-11-07 09:29:39,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 759 states have (on average 1.308300395256917) internal successors, (993), 769 states have internal predecessors, (993), 132 states have call successors, (132), 18 states have call predecessors, (132), 18 states have return successors, (132), 122 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-07 09:29:39,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1257 transitions. [2024-11-07 09:29:39,616 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1257 transitions. Word has length 118 [2024-11-07 09:29:39,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:29:39,616 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1257 transitions. [2024-11-07 09:29:39,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:39,617 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1257 transitions. [2024-11-07 09:29:39,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 09:29:39,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:39,619 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:39,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 09:29:39,619 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:39,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:39,620 INFO L85 PathProgramCache]: Analyzing trace with hash -734222472, now seen corresponding path program 1 times [2024-11-07 09:29:39,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:29:39,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683621233] [2024-11-07 09:29:39,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:39,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:29:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:40,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:29:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:40,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:29:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:40,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:29:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:40,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:29:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:40,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:29:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:40,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:29:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:40,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:29:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:40,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:29:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:40,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:29:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:40,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:29:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:40,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:29:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:40,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:29:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:40,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:29:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:40,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:29:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:40,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:29:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:40,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:29:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:40,495 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:29:40,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:29:40,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683621233] [2024-11-07 09:29:40,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683621233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:29:40,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:29:40,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 09:29:40,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868398967] [2024-11-07 09:29:40,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:29:40,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 09:29:40,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:29:40,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 09:29:40,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:29:40,498 INFO L87 Difference]: Start difference. First operand 910 states and 1257 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:41,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:29:41,759 INFO L93 Difference]: Finished difference Result 2191 states and 3021 transitions. [2024-11-07 09:29:41,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 09:29:41,760 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-07 09:29:41,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:29:41,770 INFO L225 Difference]: With dead ends: 2191 [2024-11-07 09:29:41,770 INFO L226 Difference]: Without dead ends: 1498 [2024-11-07 09:29:41,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 09:29:41,773 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 64 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:29:41,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 814 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 09:29:41,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2024-11-07 09:29:41,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1218. [2024-11-07 09:29:41,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 1039 states have (on average 1.3070259865255054) internal successors, (1358), 1052 states have internal predecessors, (1358), 156 states have call successors, (156), 22 states have call predecessors, (156), 22 states have return successors, (156), 143 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-07 09:29:41,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1670 transitions. [2024-11-07 09:29:41,906 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1670 transitions. Word has length 118 [2024-11-07 09:29:41,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:29:41,906 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1670 transitions. [2024-11-07 09:29:41,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:41,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1670 transitions. [2024-11-07 09:29:41,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 09:29:41,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:41,909 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:41,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 09:29:41,909 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:41,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:41,910 INFO L85 PathProgramCache]: Analyzing trace with hash 545641206, now seen corresponding path program 1 times [2024-11-07 09:29:41,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:29:41,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764633078] [2024-11-07 09:29:41,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:41,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:29:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:42,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:29:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:42,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:29:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:42,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:29:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:42,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:29:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:42,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:29:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:42,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:29:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:42,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:29:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:42,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:29:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:42,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:29:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:42,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:29:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:42,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:29:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:42,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:29:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:42,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:29:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:42,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:29:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:42,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:29:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:42,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:29:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:42,499 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:29:42,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:29:42,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764633078] [2024-11-07 09:29:42,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764633078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:29:42,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:29:42,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 09:29:42,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119365569] [2024-11-07 09:29:42,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:29:42,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 09:29:42,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:29:42,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 09:29:42,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:29:42,501 INFO L87 Difference]: Start difference. First operand 1218 states and 1670 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:44,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:29:44,040 INFO L93 Difference]: Finished difference Result 2517 states and 3432 transitions. [2024-11-07 09:29:44,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 09:29:44,042 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-07 09:29:44,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:29:44,051 INFO L225 Difference]: With dead ends: 2517 [2024-11-07 09:29:44,052 INFO L226 Difference]: Without dead ends: 1615 [2024-11-07 09:29:44,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 09:29:44,058 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 39 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 09:29:44,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 646 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 09:29:44,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2024-11-07 09:29:44,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1602. [2024-11-07 09:29:44,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1388 states have (on average 1.2845821325648414) internal successors, (1783), 1412 states have internal predecessors, (1783), 178 states have call successors, (178), 35 states have call predecessors, (178), 35 states have return successors, (178), 154 states have call predecessors, (178), 178 states have call successors, (178) [2024-11-07 09:29:44,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2139 transitions. [2024-11-07 09:29:44,251 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2139 transitions. Word has length 118 [2024-11-07 09:29:44,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:29:44,251 INFO L471 AbstractCegarLoop]: Abstraction has 1602 states and 2139 transitions. [2024-11-07 09:29:44,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:44,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2139 transitions. [2024-11-07 09:29:44,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 09:29:44,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:44,255 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:44,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 09:29:44,255 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:44,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:44,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1079010836, now seen corresponding path program 1 times [2024-11-07 09:29:44,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:29:44,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468246558] [2024-11-07 09:29:44,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:44,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:29:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:44,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:29:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:44,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:29:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:44,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:29:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:44,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:29:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:44,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:29:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:44,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:29:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:44,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:29:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:44,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:29:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:44,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:29:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:44,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:29:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:44,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:29:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:44,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:29:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:44,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:29:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:44,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:29:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:44,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:29:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:44,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:29:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:29:44,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:29:44,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468246558] [2024-11-07 09:29:44,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468246558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:29:44,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:29:44,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 09:29:44,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183937949] [2024-11-07 09:29:44,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:29:44,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 09:29:44,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:29:44,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 09:29:44,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:29:44,570 INFO L87 Difference]: Start difference. First operand 1602 states and 2139 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 09:29:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:29:45,116 INFO L93 Difference]: Finished difference Result 3000 states and 4038 transitions. [2024-11-07 09:29:45,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 09:29:45,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 118 [2024-11-07 09:29:45,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:29:45,130 INFO L225 Difference]: With dead ends: 3000 [2024-11-07 09:29:45,131 INFO L226 Difference]: Without dead ends: 1848 [2024-11-07 09:29:45,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-07 09:29:45,135 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 189 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 09:29:45,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 447 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 09:29:45,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2024-11-07 09:29:45,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1828. [2024-11-07 09:29:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1828 states, 1562 states have (on average 1.267605633802817) internal successors, (1980), 1591 states have internal predecessors, (1980), 218 states have call successors, (218), 47 states have call predecessors, (218), 47 states have return successors, (218), 189 states have call predecessors, (218), 218 states have call successors, (218) [2024-11-07 09:29:45,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 2416 transitions. [2024-11-07 09:29:45,366 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 2416 transitions. Word has length 118 [2024-11-07 09:29:45,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:29:45,366 INFO L471 AbstractCegarLoop]: Abstraction has 1828 states and 2416 transitions. [2024-11-07 09:29:45,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 09:29:45,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2416 transitions. [2024-11-07 09:29:45,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 09:29:45,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:45,369 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:45,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 09:29:45,369 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:45,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:45,370 INFO L85 PathProgramCache]: Analyzing trace with hash -654609696, now seen corresponding path program 1 times [2024-11-07 09:29:45,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:29:45,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683417422] [2024-11-07 09:29:45,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:45,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:29:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:45,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:29:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:45,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:29:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:45,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:29:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:45,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:29:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:45,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:29:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:45,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:29:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:45,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:29:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:45,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:29:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:45,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:29:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:45,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:29:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:45,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:29:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:45,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:29:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:45,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:29:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:45,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:29:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:45,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:29:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:45,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:29:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:29:45,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:29:45,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683417422] [2024-11-07 09:29:45,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683417422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:29:45,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:29:45,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 09:29:45,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305064138] [2024-11-07 09:29:45,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:29:45,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 09:29:45,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:29:45,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 09:29:45,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:29:45,450 INFO L87 Difference]: Start difference. First operand 1828 states and 2416 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:45,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:29:45,674 INFO L93 Difference]: Finished difference Result 3240 states and 4299 transitions. [2024-11-07 09:29:45,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 09:29:45,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-07 09:29:45,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:29:45,686 INFO L225 Difference]: With dead ends: 3240 [2024-11-07 09:29:45,686 INFO L226 Difference]: Without dead ends: 1854 [2024-11-07 09:29:45,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:29:45,689 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 50 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:29:45,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 258 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:29:45,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2024-11-07 09:29:45,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1385. [2024-11-07 09:29:45,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1191 states have (on average 1.2636439966414776) internal successors, (1505), 1206 states have internal predecessors, (1505), 158 states have call successors, (158), 35 states have call predecessors, (158), 35 states have return successors, (158), 143 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-07 09:29:45,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1821 transitions. [2024-11-07 09:29:45,841 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1821 transitions. Word has length 118 [2024-11-07 09:29:45,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:29:45,841 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1821 transitions. [2024-11-07 09:29:45,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:45,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1821 transitions. [2024-11-07 09:29:45,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 09:29:45,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:45,843 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:45,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 09:29:45,844 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:45,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:45,844 INFO L85 PathProgramCache]: Analyzing trace with hash 230659259, now seen corresponding path program 1 times [2024-11-07 09:29:45,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:29:45,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450615617] [2024-11-07 09:29:45,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:45,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:29:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:46,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:29:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:46,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:29:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:46,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:29:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:46,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:29:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:46,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:29:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:46,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:29:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:46,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:29:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:46,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:29:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:46,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:29:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:46,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:29:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:46,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:29:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:46,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:29:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:46,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:29:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:46,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:29:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:46,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:29:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:46,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:29:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:29:46,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:29:46,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450615617] [2024-11-07 09:29:46,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450615617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:29:46,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:29:46,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 09:29:46,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779786794] [2024-11-07 09:29:46,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:29:46,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 09:29:46,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:29:46,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 09:29:46,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 09:29:46,272 INFO L87 Difference]: Start difference. First operand 1385 states and 1821 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:46,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:29:46,822 INFO L93 Difference]: Finished difference Result 2772 states and 3652 transitions. [2024-11-07 09:29:46,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 09:29:46,823 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-07 09:29:46,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:29:46,832 INFO L225 Difference]: With dead ends: 2772 [2024-11-07 09:29:46,833 INFO L226 Difference]: Without dead ends: 1634 [2024-11-07 09:29:46,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-07 09:29:46,837 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 137 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 09:29:46,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 749 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 09:29:46,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-11-07 09:29:46,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1385. [2024-11-07 09:29:46,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1191 states have (on average 1.260285474391268) internal successors, (1501), 1206 states have internal predecessors, (1501), 158 states have call successors, (158), 35 states have call predecessors, (158), 35 states have return successors, (158), 143 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-07 09:29:46,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1817 transitions. [2024-11-07 09:29:46,986 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1817 transitions. Word has length 119 [2024-11-07 09:29:46,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:29:46,987 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1817 transitions. [2024-11-07 09:29:46,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:46,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1817 transitions. [2024-11-07 09:29:46,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 09:29:46,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:46,989 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:46,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 09:29:46,989 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:46,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:46,990 INFO L85 PathProgramCache]: Analyzing trace with hash -327146750, now seen corresponding path program 1 times [2024-11-07 09:29:46,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:29:46,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017213711] [2024-11-07 09:29:46,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:46,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:29:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:47,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:29:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:47,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:29:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:47,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:29:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:47,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:29:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:47,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:29:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:47,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:29:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:47,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:29:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:47,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:29:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:47,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:29:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:47,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:29:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:47,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:29:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:47,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:29:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:47,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:29:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:47,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:29:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:47,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:29:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:47,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:29:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:47,541 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:29:47,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:29:47,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017213711] [2024-11-07 09:29:47,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017213711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:29:47,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:29:47,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 09:29:47,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171929388] [2024-11-07 09:29:47,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:29:47,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 09:29:47,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:29:47,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 09:29:47,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-07 09:29:47,545 INFO L87 Difference]: Start difference. First operand 1385 states and 1817 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:48,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:29:48,252 INFO L93 Difference]: Finished difference Result 2715 states and 3584 transitions. [2024-11-07 09:29:48,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 09:29:48,253 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-07 09:29:48,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:29:48,262 INFO L225 Difference]: With dead ends: 2715 [2024-11-07 09:29:48,262 INFO L226 Difference]: Without dead ends: 1635 [2024-11-07 09:29:48,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2024-11-07 09:29:48,265 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 187 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 09:29:48,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 689 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 09:29:48,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2024-11-07 09:29:48,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1391. [2024-11-07 09:29:48,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1197 states have (on average 1.2589807852965749) internal successors, (1507), 1212 states have internal predecessors, (1507), 158 states have call successors, (158), 35 states have call predecessors, (158), 35 states have return successors, (158), 143 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-07 09:29:48,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1823 transitions. [2024-11-07 09:29:48,414 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1823 transitions. Word has length 119 [2024-11-07 09:29:48,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:29:48,415 INFO L471 AbstractCegarLoop]: Abstraction has 1391 states and 1823 transitions. [2024-11-07 09:29:48,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:48,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1823 transitions. [2024-11-07 09:29:48,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 09:29:48,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:48,417 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:48,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 09:29:48,417 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:48,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:48,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1350068558, now seen corresponding path program 1 times [2024-11-07 09:29:48,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:29:48,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445704506] [2024-11-07 09:29:48,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:48,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:29:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:48,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:29:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:48,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:29:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:48,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:29:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:48,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:29:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:48,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:29:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:48,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:29:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:48,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:29:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:48,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:29:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:48,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:29:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:48,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:29:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:48,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:29:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:48,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:29:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:48,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:29:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:48,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:29:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:48,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:29:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:48,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:29:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 75 proven. 9 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2024-11-07 09:29:48,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:29:48,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445704506] [2024-11-07 09:29:48,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445704506] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 09:29:48,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341948985] [2024-11-07 09:29:48,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:48,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 09:29:48,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:29:48,634 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 09:29:48,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 09:29:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:48,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 09:29:48,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:29:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 194 proven. 9 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2024-11-07 09:29:48,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 09:29:49,176 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 75 proven. 12 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2024-11-07 09:29:49,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341948985] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 09:29:49,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 09:29:49,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 12 [2024-11-07 09:29:49,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892228478] [2024-11-07 09:29:49,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 09:29:49,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 09:29:49,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:29:49,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 09:29:49,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-07 09:29:49,179 INFO L87 Difference]: Start difference. First operand 1391 states and 1823 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-07 09:29:49,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:29:49,589 INFO L93 Difference]: Finished difference Result 2835 states and 3676 transitions. [2024-11-07 09:29:49,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 09:29:49,590 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 119 [2024-11-07 09:29:49,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:29:49,601 INFO L225 Difference]: With dead ends: 2835 [2024-11-07 09:29:49,601 INFO L226 Difference]: Without dead ends: 1489 [2024-11-07 09:29:49,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 262 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2024-11-07 09:29:49,606 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 290 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 09:29:49,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 252 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 09:29:49,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2024-11-07 09:29:49,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1423. [2024-11-07 09:29:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 1221 states have (on average 1.2391482391482391) internal successors, (1513), 1236 states have internal predecessors, (1513), 158 states have call successors, (158), 43 states have call predecessors, (158), 43 states have return successors, (158), 143 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-07 09:29:49,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1829 transitions. [2024-11-07 09:29:49,775 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1829 transitions. Word has length 119 [2024-11-07 09:29:49,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:29:49,776 INFO L471 AbstractCegarLoop]: Abstraction has 1423 states and 1829 transitions. [2024-11-07 09:29:49,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-07 09:29:49,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1829 transitions. [2024-11-07 09:29:49,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 09:29:49,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:49,779 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:49,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 09:29:49,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 09:29:49,980 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:49,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:49,981 INFO L85 PathProgramCache]: Analyzing trace with hash 437433562, now seen corresponding path program 1 times [2024-11-07 09:29:49,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:29:49,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999660882] [2024-11-07 09:29:49,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:49,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:29:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 09:29:50,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [963043016] [2024-11-07 09:29:50,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:50,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 09:29:50,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:29:50,043 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 09:29:50,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 09:29:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 09:29:50,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 09:29:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 09:29:50,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 09:29:50,285 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 09:29:50,286 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 09:29:50,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 09:29:50,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 09:29:50,492 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:50,589 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 09:29:50,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:29:50 BoogieIcfgContainer [2024-11-07 09:29:50,593 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 09:29:50,594 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 09:29:50,594 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 09:29:50,594 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 09:29:50,595 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:29:25" (3/4) ... [2024-11-07 09:29:50,599 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 09:29:50,600 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 09:29:50,601 INFO L158 Benchmark]: Toolchain (without parser) took 26001.60ms. Allocated memory was 117.4MB in the beginning and 469.8MB in the end (delta: 352.3MB). Free memory was 92.1MB in the beginning and 422.1MB in the end (delta: -330.0MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-11-07 09:29:50,601 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:29:50,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.73ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 79.0MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 09:29:50,602 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.57ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 75.4MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:29:50,602 INFO L158 Benchmark]: Boogie Preprocessor took 84.17ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 71.0MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:29:50,602 INFO L158 Benchmark]: RCFGBuilder took 501.11ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 47.8MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 09:29:50,602 INFO L158 Benchmark]: TraceAbstraction took 25091.74ms. Allocated memory was 117.4MB in the beginning and 469.8MB in the end (delta: 352.3MB). Free memory was 47.3MB in the beginning and 422.2MB in the end (delta: -374.9MB). Peak memory consumption was 240.0MB. Max. memory is 16.1GB. [2024-11-07 09:29:50,602 INFO L158 Benchmark]: Witness Printer took 6.43ms. Allocated memory is still 469.8MB. Free memory was 422.2MB in the beginning and 422.1MB in the end (delta: 120.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:29:50,603 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.73ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 79.0MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.57ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 75.4MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 84.17ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 71.0MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 501.11ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 47.8MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 25091.74ms. Allocated memory was 117.4MB in the beginning and 469.8MB in the end (delta: 352.3MB). Free memory was 47.3MB in the beginning and 422.2MB in the end (delta: -374.9MB). Peak memory consumption was 240.0MB. Max. memory is 16.1GB. * Witness Printer took 6.43ms. Allocated memory is still 469.8MB. Free memory was 422.2MB in the beginning and 422.1MB in the end (delta: 120.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_3 = 128; [L24] unsigned short int var_1_4 = 4; [L25] unsigned short int var_1_5 = 0; [L26] signed short int var_1_6 = 0; [L27] unsigned char var_1_7 = 1; [L28] signed short int var_1_8 = -2; [L29] signed short int var_1_9 = 500; [L30] unsigned long int var_1_10 = 10; [L31] unsigned char var_1_11 = 2; [L32] unsigned char var_1_12 = 64; [L33] unsigned long int var_1_13 = 1; [L34] unsigned long int last_1_var_1_10 = 10; [L35] unsigned long int last_1_var_1_13 = 1; VAL [isInitial=0, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=128, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] CALL updateLastVariables() [L86] last_1_var_1_10 = var_1_10 [L87] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=128, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L97] RET updateLastVariables() [L98] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_ushort() [L61] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L61] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L62] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L62] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L63] var_1_4 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L64] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L65] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L65] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L66] var_1_5 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L67] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L68] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L68] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L69] var_1_7 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L70] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L71] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L71] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L72] var_1_8 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_8 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L73] RET assume_abort_if_not(var_1_8 >= -16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L74] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L74] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L75] var_1_9 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_9 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L76] RET assume_abort_if_not(var_1_9 >= -16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L77] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L77] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L78] var_1_11 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L79] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L80] CALL assume_abort_if_not(var_1_11 <= 128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L80] RET assume_abort_if_not(var_1_11 <= 128) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L81] var_1_12 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L82] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L83] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L83] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L98] RET updateVariables() [L99] CALL step() [L39] COND FALSE !(last_1_var_1_13 >= -50) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L42] EXPR var_1_11 & var_1_12 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L42] signed long int stepLocal_0 = var_1_11 & var_1_12; [L43] COND TRUE \read(var_1_7) [L44] var_1_13 = ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=22] [L50] COND TRUE \read(var_1_7) [L51] var_1_6 = (var_1_8 + var_1_9) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L53] EXPR last_1_var_1_10 >> var_1_1 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L53] EXPR var_1_8 << var_1_5 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L53] EXPR (last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L53] COND FALSE !((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) [L56] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=1, var_1_10=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR (((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L90] EXPR last_1_var_1_10 >> var_1_1 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L90] EXPR var_1_8 << var_1_5 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L90] EXPR (last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L90] EXPR (((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L90] EXPR ((((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11)))) && (var_1_7 ? (var_1_13 == ((unsigned long int) ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))))) : (((var_1_11 & var_1_12) != var_1_1) ? (var_1_13 == ((unsigned long int) var_1_12)) : 1)) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L90-L91] return ((((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11)))) && (var_1_7 ? (var_1_13 == ((unsigned long int) ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))))) : (((var_1_11 & var_1_12) != var_1_1) ? (var_1_13 == ((unsigned long int) var_1_12)) : 1)) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.9s, OverallIterations: 21, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2194 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2181 mSDsluCounter, 9881 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7469 mSDsCounter, 482 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2768 IncrementalHoareTripleChecker+Invalid, 3250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 482 mSolverCounterUnsat, 2412 mSDtfsCounter, 2768 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1082 GetRequests, 933 SyntacticMatches, 2 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1828occurred in iteration=16, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 1974 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 2669 NumberOfCodeBlocks, 2669 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2526 ConstructedInterpolants, 0 QuantifiedInterpolants, 10714 SizeOfPredicates, 1 NumberOfNonLiveVariables, 270 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 10530/10560 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 09:29:50,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 736d11fbaff9bd8217e7f35fe2915a40a2ccc3f0b056dd854b0369e62e08ee86 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:29:53,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:29:53,217 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 09:29:53,224 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:29:53,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:29:53,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:29:53,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:29:53,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:29:53,251 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:29:53,251 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:29:53,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:29:53,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:29:53,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:29:53,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:29:53,252 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:29:53,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:29:53,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:29:53,252 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:29:53,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:29:53,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:29:53,252 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:29:53,252 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:29:53,252 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:29:53,252 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 09:29:53,252 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 09:29:53,253 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:29:53,253 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 09:29:53,253 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:29:53,253 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:29:53,253 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:29:53,253 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:29:53,253 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:29:53,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:29:53,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:29:53,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:29:53,255 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:29:53,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:29:53,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:29:53,256 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 09:29:53,256 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 09:29:53,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:29:53,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:29:53,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:29:53,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:29:53,257 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 -> 736d11fbaff9bd8217e7f35fe2915a40a2ccc3f0b056dd854b0369e62e08ee86 [2024-11-07 09:29:53,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:29:53,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:29:53,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:29:53,627 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:29:53,628 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:29:53,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i [2024-11-07 09:29:55,105 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:29:55,379 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:29:55,380 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i [2024-11-07 09:29:55,389 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed050a3a8/3ed1c9f511fa493fb9c8f4d23decefc9/FLAGc6a87080e [2024-11-07 09:29:55,417 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed050a3a8/3ed1c9f511fa493fb9c8f4d23decefc9 [2024-11-07 09:29:55,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:29:55,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:29:55,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:29:55,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:29:55,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:29:55,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:29:55" (1/1) ... [2024-11-07 09:29:55,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d3cfc1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:55, skipping insertion in model container [2024-11-07 09:29:55,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:29:55" (1/1) ... [2024-11-07 09:29:55,454 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:29:55,607 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i[915,928] [2024-11-07 09:29:55,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:29:55,677 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:29:55,687 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i[915,928] [2024-11-07 09:29:55,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:29:55,736 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:29:55,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:55 WrapperNode [2024-11-07 09:29:55,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:29:55,741 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:29:55,741 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:29:55,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:29:55,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:55" (1/1) ... [2024-11-07 09:29:55,766 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:55" (1/1) ... [2024-11-07 09:29:55,790 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-11-07 09:29:55,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:29:55,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:29:55,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:29:55,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:29:55,801 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:55" (1/1) ... [2024-11-07 09:29:55,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:55" (1/1) ... [2024-11-07 09:29:55,804 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:55" (1/1) ... [2024-11-07 09:29:55,817 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 09:29:55,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:55" (1/1) ... [2024-11-07 09:29:55,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:55" (1/1) ... [2024-11-07 09:29:55,827 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:55" (1/1) ... [2024-11-07 09:29:55,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:55" (1/1) ... [2024-11-07 09:29:55,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:55" (1/1) ... [2024-11-07 09:29:55,839 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:55" (1/1) ... [2024-11-07 09:29:55,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:29:55,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:29:55,843 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:29:55,843 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:29:55,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:55" (1/1) ... [2024-11-07 09:29:55,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:29:55,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:29:55,880 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 09:29:55,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 09:29:55,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:29:55,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 09:29:55,911 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:29:55,911 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:29:55,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:29:55,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:29:55,987 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:29:55,989 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:29:56,294 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-07 09:29:56,295 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:29:56,304 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:29:56,305 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:29:56,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:29:56 BoogieIcfgContainer [2024-11-07 09:29:56,305 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:29:56,308 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:29:56,308 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:29:56,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:29:56,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:29:55" (1/3) ... [2024-11-07 09:29:56,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af14ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:29:56, skipping insertion in model container [2024-11-07 09:29:56,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:29:55" (2/3) ... [2024-11-07 09:29:56,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af14ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:29:56, skipping insertion in model container [2024-11-07 09:29:56,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:29:56" (3/3) ... [2024-11-07 09:29:56,317 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-32.i [2024-11-07 09:29:56,331 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:29:56,331 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:29:56,395 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:29:56,405 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;@f13f62b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:29:56,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:29:56,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 09:29:56,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 09:29:56,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:56,445 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:56,445 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:56,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:56,451 INFO L85 PathProgramCache]: Analyzing trace with hash -825664696, now seen corresponding path program 1 times [2024-11-07 09:29:56,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:29:56,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780332510] [2024-11-07 09:29:56,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:56,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 09:29:56,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:29:56,468 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 09:29:56,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 09:29:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:56,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 09:29:56,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:29:57,045 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:29:57,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:29:57,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:29:57,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780332510] [2024-11-07 09:29:57,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780332510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:29:57,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:29:57,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 09:29:57,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485576042] [2024-11-07 09:29:57,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:29:57,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 09:29:57,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:29:57,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 09:29:57,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 09:29:57,078 INFO L87 Difference]: Start difference. First operand has 49 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:57,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:29:57,275 INFO L93 Difference]: Finished difference Result 142 states and 250 transitions. [2024-11-07 09:29:57,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 09:29:57,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 102 [2024-11-07 09:29:57,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:29:57,289 INFO L225 Difference]: With dead ends: 142 [2024-11-07 09:29:57,290 INFO L226 Difference]: Without dead ends: 96 [2024-11-07 09:29:57,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 09:29:57,298 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 45 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:29:57,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 187 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:29:57,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-07 09:29:57,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 85. [2024-11-07 09:29:57,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 09:29:57,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 125 transitions. [2024-11-07 09:29:57,372 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 125 transitions. Word has length 102 [2024-11-07 09:29:57,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:29:57,372 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 125 transitions. [2024-11-07 09:29:57,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:29:57,373 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 125 transitions. [2024-11-07 09:29:57,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 09:29:57,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:29:57,375 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:29:57,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-07 09:29:57,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 09:29:57,580 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:29:57,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:29:57,581 INFO L85 PathProgramCache]: Analyzing trace with hash -145606326, now seen corresponding path program 1 times [2024-11-07 09:29:57,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:29:57,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368107632] [2024-11-07 09:29:57,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:29:57,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 09:29:57,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:29:57,585 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 09:29:57,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 09:29:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:29:57,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 09:29:57,710 INFO L278 TraceCheckSpWp]: Computing forward predicates...